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.

---

解题思路：十进制-》二进制-》反码-》十进制

class Solution {
public:
    int findComplement(int num) {
        int a[33];
        int count=0;
        while(num!=0){
            a[count]=1-num%2;
            count++;
            num/=2;
        }
        int b=0;
        int ans=0;
        while(b!=count ){
            ans+=a[b]*pow(2,b);
            b++;
        }
        return ans;
    }
};