iven 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,我们再构造一个数x:使得对应于num左边所有0的位上,x全是1;num自第一个1向右,x全是0。
最后,对~num 和 ~x 进行与运算,即可以将num有效位数的部分求补并保留,得到题目所要求的二进制补数。
根据这个思路。可以写出如下代码:
public class Solution {
public int findComplement(int num) {
int x = ~0;
while ((x & num)!=0){
x <<= 1;
}
return (~x)&(~num);
}
}