[LeetCode] 476.Number Complement

[LeetCode] 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 t = num;
        int i = 0;
        while(t) {
            t >>= 1;
            num ^= (1 << i);
            i += 1;
        }
        return num;
    }
};