[leetcode] 1012. Complement of Base 10 Integer : https://leetcode.com/problems/complement-of-base-10-integer/

Complement of Base 10 Integer.cpp

class Solution {
public:
    int bitwiseComplement(int N) {
        if(N == 0)  return 1;
        int tmp = 1;
        int answer = 0;
        while(0 < N){
            answer += ((N + 1) % 2) * tmp;
            N /= 2;
            tmp *= 2;
        }
        return answer;
    }
};