LeetCode-476. Number Complement

Description

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.

Solution 1(C++)

static int x=[](){std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
class Solution {
public:
    int findComplement(int num) {
        long i=1;
        while(num>=i){
            num ^= i;
            i=i << 1;
        }
        return num;
    }
};

Solution 2(C++)

static int x=[](){std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
class Solution {
public:
    int findComplement(int num) {
        unsigned mask = ~0;
        while (num & mask) mask <<= 1;
        return ~mask & ~num;
    }
};

算法分析

现在进入到LeetCode二进制运算专题了。可以帮助自己加强一下基础运算能力。

算法不用多分析，毕竟Easy难度。

• 与0异或 ^，二进制保持不变
• 与1异或 ^， 二进制取反
• 与0与 &， 二进制恒为0
• 与1与 &， 二进制只有为1才为1，否则为0
• 与0或 |，二进制只有为0才为0，否则为1
• 与1或 |，二进制恒为1

程序分析

略。