476. Number Complement*

最新推荐文章于 2020-04-01 17:34:50 发布

Yingying_code

最新推荐文章于 2020-04-01 17:34:50 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode Java bit manipulation

本文链接：https://blog.youkuaiyun.com/alwaystry/article/details/54564001

261 篇文章

订阅专栏

188 篇文章

订阅专栏

5 篇文章

订阅专栏

本文介绍了一种求正整数补码的算法实现。通过翻转输入整数的二进制表示来获得其补码，并提供了具体的代码示例。特别讨论了如何处理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. So you need to output 0.

    public int findComplement(int num) {
        return ~num & ((Integer.highestOneBit(num) << 1) - 1);
    }

总结：还是需要对基本函数熟悉，要不然就得自己写。