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.
题目解析
对于给定的数,输出其补数,补数的定义为将其对应的二进制位的数进行反转,但是反转的起始位从最高位的1开始的
解题思路
位操作符本身就有取反的符号,但是直接对num取反就是对所有位取反,而最高位1之前的0是不能反转的,所有需要用mask标记最高位1之前所有0的位置,然后对mask取反后与对num取反后的结果
/* C++ */
class Solution {
public:
int findComplement(int num) {
unsigned mask;
mask=~0;
while(num & mask) mask<<=1;
return ~mask & ~num;
}
};