1009. Complement of Base 10 Integer

Every non-negative integer N has a binary representation. For example, 5 can be represented as “101” in binary, 11 as “1011” in binary, and so on. Note that except for N = 0, there are no leading zeroes in any binary representation.

The complement of a binary representation is the number in binary you get when changing every 1 to a 0 and 0 to a 1. For example, the complement of “101” in binary is “010” in binary.

For a given number N in base-10, return the complement of it’s binary representation as a base-10 integer.

Example 1:

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

Example 2:

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

Example 3:

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

Note:

0 <= N < 10^9

难度：easy
解题思路：
方法1常规思路，将十进制变成二进制然后取反加和，方法二，利用位运算直接取反.
代码1：

class Solution {
public:
    int bitwiseComplement(int N) {
        vector<int> v;
        if(!N) return 1;
        while(N){
            v.push_back(N%2);
            N/=2;
        }
        reverse(v.begin(),v.end());
        int ret=0;
        for(auto it:v){
            ret=ret*2+(~it&1);
        }
        return ret;
    }
};

代码2：

class Solution {
public:
    int bitwiseComplement(int N) {
        int i=0;
        if(!N) return 1;
        while(N>pow(2,i)) i++;
        return (~N)&int(pow(2,i)-1);
    }
};