描述
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:
1 | Input: 5 |
Example 2:
1 | Input: 1 |
分析
给定一个整数,要求我们求其补数,把这个数的二进制表示翻过来就行了,如果是使用 ~ 运算会有个问题,最高位1前面的0也会被翻转,在 Java 里,使用 highestOneBit(i) 函数可以取 i 的二进制形式的最左边的最高位,其他位补零,将其减一再与 ~ 运算后的数进行与运算即为我们想要的结果。
解决方案1(Java)
1 | class Solution { |