Leetcode: Number Complement

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.

Better solution:

public static int highestOneBit(int i)

Returns an int value with at most a single one-bit, in the position of the highest-order ("leftmost") one-bit in the specified int value. 

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

一般方法：

 public class Solution {
     public int findComplement(int num) {
         int res = 0;
         int i = 31;
         while (i >= 0) {
             if (((num >>> i) & 1) == 1) break;
             i--;
         }
         while (i >= 0) {
             if (((num >>> i) & 1) == 0) {
                 res |= 1<<i;
             }
             i--;
         }
         return res;
     }
 }