The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation.


	For example, The integer 5 is "101" in binary and its complement is "010" which is the integer 2.


Given an integer n, return its complement.

&nbsp;
Example 1:

Input: n = 5
Output: 2
Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.


Example 2:

Input: n = 7
Output: 0
Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.


Example 3:

Input: n = 10
Output: 5
Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.


&nbsp;
Constraints:


	0 &lt;= n &lt; 109


&nbsp;
Note: This question is the same as 476: https://leetcode.com/problems/number-complement/

class Solution:
    def bitwiseComplement(self, n: int) -> int:
        cnt=0
        ans=0
        if n==0:
            return 1
        while n>0:
            if n&1:
                cnt+=1
            else:
                ans =ans +(2**cnt)
                cnt+=1
            n=n>>1
        return ans
class Solution {
    public int bitwiseComplement(int n) {
        String bin = Integer.toBinaryString(n);
        String res = "";
        for(char c :bin.toCharArray())
        {
            if( c == '1')
                res += "0";
            else
                res += "1";
        }
        return Integer.parseInt(res, 2);
    }
}
class Solution {
public:
    int bitwiseComplement(int num) {
		    //base case
        if(num == 0) return 1;
        unsigned mask = ~0;
        while( mask & num ) mask = mask << 1;
        return ~num ^ mask;
    }
};
var bitwiseComplement = function(n) {
    let xor = 0b1;
    let copy = Math.floor(n / 2);
    while (copy > 0) {
        xor = (xor << 1) + 1
        copy = Math.floor(copy / 2);
    }
        
    return n ^ xor;
};
Complement of Base 10 Integer