数据结构与算法：leetcode_476_Number Complement

最新推荐文章于 2025-08-13 15:50:21 发布

原创最新推荐文章于 2025-08-13 15:50:21 发布 · 182 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构 #算法 #leetcode

数据结构与算法专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种针对正整数求其补数的算法实现。通过翻转输入整数的二进制表示中的每一位比特来获取其补数，并提供了一个具体的Java方法实现。示例中包括了输入5和1时的补数计算过程。

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

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

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.

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.

Notes
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.
Solution

    public  int findComplement(int num) {
        char[] cnum = Integer.toBinaryString(num).toCharArray();
        int length = cnum.length;
        int temp = 0;
        for (int i = 0; i < length; i++) {
            if (cnum[i] == '1') {
                cnum[i] = '0';
            } else {
                cnum[i] = '1';
                temp += Math.pow(2, length - i - 1);
            }
        }
        System.out.println(temp);
        return temp;
    }