LeetCode 476. Number Complement (按位取反)

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

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.

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.

输入一个十进制数，返回按位取反的十进制结果。

思路：如输入5（二进制101），则与7（111）进行异或。先计算log2(5)=2，然后计算2^(2+1)-1=8-1=7，然后计算5 xor 7

    int findComplement(int num) {
        int a = log2(num);
        int b = pow(2,a+1)-1;
        return num xor b;
    }