LeetCode 476. Number Complement

weixin_30869099

于 2018-12-04 21:45:00 发布

阅读量50

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/A-Little-Nut/p/10067536.html

本文深入探讨了如何计算一个正整数的补码，通过翻转其二进制表示中的位来实现。文章提供了两个具体示例，分别对输入5和1进行操作，并详细解释了补码的计算过程。此外，还分享了一段C++代码，展示了如何通过算法实现这一功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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 temp=0, i=0;
        while(num!=0){
            if(num%2==0)
               temp+=pow(2,i);
            num/=2;
            i++;
        }
        return temp;
    }
};

转载于:https://www.cnblogs.com/A-Little-Nut/p/10067536.html