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.

自己的解答：

public class Solution {
    public int FindComplement(int num) {
            int index = 0;
            for (int i =0; i<32; i++) //找到二进制开始的地方
            {
                int s;
                s = num >> i;
                if(s==0)
                {
                    index = i;
                    break;
                }
            }
            for (int i =0; i<index ;i++ ) //逐位进行亦或
            {
                num=num^(1<<i);
            }
        return num;
    }
}