PROBLEM:
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.
SOLVE:
class Solution { //有个循环,一位位操作
public:
int findComplement(int num) {
int res=0;
for(int i=0;num>0;num>>=1,i++)
res+=((num&1)^1)<<i;
return res;
}
};
class Solution:
def findComplement(self, num):
mask=~0
while(mask&num):
mask<<=1
return ~mask^num
分析:通过比较可以发现下面一种思路会好一点,直接对整个数字进行操作,不用进行循环。