1 解题思想
这道题给了一个正的整数,然后需要计算一个特殊的补数,这个补数的计算方式是:
1、对于这个整数num,转换成对应的二进制表示,这个二进制表示共有x位(不高于32)
2、将这x位取反后,得到对应的10进制值就是结果
这道题的难点在于:
1、因为java(或其他)里,int一般长度是32bit,直接按位取反不对,因为前面多余的0不能取反
2、如果遍历的话,开销比较大
所以解题思想就是:
1、利用java里的方法Integer.highestOneBit,获得数字num出现1的最高位(也就是对应的2进制里,第一个出现1的位为1,其他为0的值)
2、将上面的值左移2,然后减1,就可以构造一个正好覆盖num整个数x位长度的遮罩mask(后x位为1,其他为0)
3、使用如上mask,将num的部分进行取反就可以
2 原题
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.
3 AC解
public class Solution {
// 制作一个mask,在mask的范围内按位取反
public int findComplement(int num) {
//System.out.println("binary bits of num:"+Integer.toBinaryString(num));
//System.out.println("binary bits of HigestOneBit of num:"+Integer.toBinaryString(Integer.highestOneBit(num)));
int mask = (Integer.highestOneBit(num) << 1) -1;
//System.out.println("binary bits of mask:"+Integer.toBinaryString(mask));
num = ~num;
return num & mask;
}
}