Easy
Complement of Base 10 Integer — C++
Full explanation · Time O(logn) · Space O(1)
// 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;
}
};