LeetCode: 476 Number Complement(easy)

原创于 2019-04-16 13:09:10 发布 · 158 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode学习笔记专栏收录该内容

30 篇文章

订阅专栏

本文深入探讨了如何求一个正整数的补码，详细解释了通过翻转其二进制表示位的方法来实现。文章提供了具体的代码示例，包括一个C++类的定义和成员函数，用于计算并返回给定整数的补码。

题目：

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

　Note:

The given integer is guaranteed to fit within the range of a 32-bit signed integer.
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.

代码：

class Solution {
public:
    int findComplement(int num) {
        int x = 0, p = 0;
        while(num){
            if(num%2==0) x |= (1 << p);
            ++p;
            num/=2;
        }
        return x;
    }
};