complement-of-base-10-integer.cpp

// Time:  O(logn)
// Space: O(1)

class Solution {
public:
    int bitwiseComplement(int N) {
        int mask = 1;
        while (N > mask) {
            mask = mask * 2 + 1;
        }
        return mask - N;
    }
};