[leetcode 1009] complement of base 10 integer

// AMAN JAIN MCA 1st YEAR 2nd SEM

// time O(N), space O(1)
// Approach: Basic bit masking
class Solution {
public:
    int bitwiseComplement(int n) {
        int i = 0;
        if(n == 0) return 1;
        while(n >> i != 0) {
            n = n ^ (1 << i);
            ++i;
        }
        return n;
    }
};