【跟Leon一起刷LeetCode】476. Number Complement

Number Complement

Description：

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its 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.

Note：

1. The given integer is guaranteed to fit within the range of a 32-bit signed integer.
2. You could assume no leading zero bit in the integer’s binary representation.

问题描述:

给定正整数,将其二进制表示方式逐位取反。
可以假设没有前导零位整数的二进制表示。

Solution：

思路一：假设原码位数为n，不考虑前导零位，将原码与11111（n个1）做异或运算。

class Solution {
    public int findComplement(int num) {
        return num ^ ((Integer.highestOneBit(num) << 1) - 1);
    }
}

思路二：假设原码位数为n，不考虑前导零位，将原码取反，将原码和11111（n个1）做相与运算。

public class Solution {
    public int findComplement(int num) {
        return ~num & ((Integer.highestOneBit(num) << 1) - 1);
    }
}