笔试题10. LeetCode OJ (10) Number Complement

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

Note:
The given integer is guaranteed to fit within the range of a 32-bit signed integer.
You could assume no leading zero bit in the integer’s binary representation.
Example 1:

Input: 5
Output: 2
Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.

Example 2:

Input: 1
Output: 0
Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.

题目的意思是：求一个数位的补集，给定输入一个数5，它的二进制是101，补集是010，故输出值为2。我一开始拿到题目的思路是直接将输入的数和1进行异或，得到的就是这个数的补集，代码如下：

class Solution {
public:
    int findComplement(int num) {
        int z=num^1;
        return z;
    }
};

可是运行出现错误，后来看了讨论，知道一般进行位运算的话，也要考虑1前面的0。
例如 0000 0101^ 1111 1111 =1111 1010 不是得到原来的值。正确答案如下：

class Solution {
public:
    int findComplement(int num) {
        unsigned mask = ~0;
        while(num&mask) mask<<=1;
        return (~num)&(~mask);
    }
};

For example,

num = 00000101
mask = 11111000
~mask & ~num = 00000010