NO.9_476. Number Complement

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.

//解1（超时）

/*
class Solution {
public:
    int findComplement(int num) 
    {
        int res=0;
        int i=1;
         do
         {
            res+=(((num&1)+1)%2)*i;
            i=i*2;
            num=int(num/2);
         }
         while(num);
       
	return res;
    }
};
*/

//解2 耗时长
//用减法

/*
class Solution {
public:
    int findComplement(int num) 
    {
        int res=0;
        long total=1;
        int i=0;
        int p=num;
        while(num)
        {
            i++;
            num=num>>1;
        }
        total=total<<i;
        res=total-p-1;
	return res;
    }
};
*/

//解3
//用加法

class Solution {
public:
    int findComplement(int num) 
    {
        int res=0;
        int i=0;
        while(num)
        {
            res=res+((!(num&1))<<i);
            i++;
            num=num>>1;
        }
	return res;
    }
};