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.
方法一:逐位取反然后拼接,效率有些低
class Solution {
public int findComplement(int num) {
int result = 0;
int i = 0;
while(num!=0){
result |= ((num & 1 ) ^ 1) << i;
System.out.println(num & 1 );
num>>=1;
i++;
}
return result;
}
}
方法二:
其实由方法一我们可以知道问题的关键在于对每一位进行与1进行异或就可以达到取反的效果,那么我们如果能够得到最高位为1的位,比如最高位为1的位为4那么构建一个1111然后整体异或即可。
最高位为1的位对应的十进制数:Integer.highestOneBit(num),内部实现
public static int highestOneBit(int i) {
// 例如1000
i |= (i >> 1); // 使前2位变为1,相当于i = i | (i >> 1); i = 1000 | 0100 = 1100
i |= (i >> 2); // 使前4位变为1,由于上一步确保了前两位都是1,所以这一次移动两位,1111
i |= (i >> 4); // 使前8位变为1,1111
i |= (i >> 8); // 使前16位变为1,1111
i |= (i >> 16); // 使前32位变为1,1111
return i - (i >>> 1); // i >>> 1 无符号右移,使最高位为0,其余位为1,相减即得出结果,1111 - 0111 = 1000
}
public int findComplement(int num) {
int mask = (Integer.highestOneBit(num) << 1) - 1;
return num^mask;
}