Leetcode学习（7）—— Number Complement

原创于 2017-05-06 00:29:54 发布 · 512 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，未经博主允许不得转载。哈哈哈

文章标签：

#leetcode

Leetcode 专栏收录该内容

53 篇文章

订阅专栏

本文介绍了一个简单的算法问题：如何计算一个正整数的补数。补数是指将一个数的二进制表示中的所有位进行反转。文章通过两个示例详细解释了这一过程：输入5（二进制为101），输出2（二进制为010）；输入1（二进制为1），输出0（二进制为0）。适用于理解基本的二进制操作。

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

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.