【leetcode】【套路题】476. Number Complement

版权声明：本文为博主原创文章，转载请标明原文地址，谢谢 ^_^ https://blog.csdn.net/xiaoquantouer/article/details/77188423

一、题目描述

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.

思路：这种题没什么办法，记住这个套路吧。举个例子，num = 00000101时，另mask = ~0 = 11111111，让mask变为 11111000，然后计算~mask & ~num即可得到结果

代码：

class Solution {
public:
    int findComplement(int num) {
        unsigned mask = ~0;
        while(mask & num){
            mask = mask << 1;
        }
        return ~mask & ~num;
        
    }
};