LeetCode:Number Complement

本文介绍了一种求解正整数补码的方法,并提供了一个具体的C++代码实现。通过翻转输入整数的二进制位来计算其补码,并确保了在32位带符号整数范围内的正确性。

摘要生成于 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.

class Solution {
public:
    int findComplement(int num) {
      vector<int>vec;
      for(int i=0;i<32;++i)
      {
          vec.push_back(0);
      }
      int st = 0;
      while(num)
      {
          vec[st++] = (num%2);
          num/=2;
      }
      int k = 31;
      while(vec[k--]==0);
      for(int j=k+1;j>=0;--j)
      {
          if(vec[j]==0)
            vec[j] = 1;
          else
            vec[j] = 0;
      }
      int res = 0;
      for(int i = 0;i<32;++i)
      {
          if(vec[i]==0)
              continue;
          else
             res += vec[i]*pow(2,i);
      }
      return res;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值