【C++】476. Number Complement

一道考察位操作和有无符号数转换的题（我的解题思路是这样的）。

题目：

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

Note:

1. The given integer is guaranteed to fit within the range of a 32-bit signed integer.
2. 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.

一开始直接返回了~num，发现符号出了错。于是考虑解决符号的问题。

解答：

class Solution {
public:
    int findComplement(int num) {
        unsigned n = num;
        for(int i=1; i<=n; i = i+i)//从最低位开始按位求反，直至num的最高位也被求反。如果直接求反，符号位也会被求反，导致错误。
        {
            n ^= i;//按位求异或
        }
        return n;
    }
};