LeetCode 476. Number Complement

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/zhaohaibo_/article/details/85269755

题目链接：Number Complement - LeetCode

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 res = 0, pos = 0;
        while(num){
            res += !(num & 1) << pos;
            num >>= 1;
            pos ++;
        }
        return res;
    }
};