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.

给定一个正整数，输出其补数。互补策略是翻转的二进制表示的位。

笔记

1. 给定的整数是保证符合一个32位有符号整数范围。
2. 你可以假定没有前导零位的整数的二进制表示。

example1

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.

example2

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.

solution：

public class Solution {
    public int findComplement(int num) 
    {
        int i = 0;
        int j = 0;
        
        while (i < num)
        {
            i += Math.pow(2, j);
            j++;
        }
        
        return i - num;
    }
}

while (i < num) //求出与num相同位数的最大数。
        {
            i += Math.pow(2, j);
            j++;
        }