【LeetCode】 476. Number Complement

最新推荐文章于 2024-08-22 20:56:05 发布

sa酱

最新推荐文章于 2024-08-22 20:56:05 发布

阅读量288

点赞数

CC 4.0 BY-SA版权

分类专栏： leetCode 文章标签： javascript leetcode

本文链接：https://blog.youkuaiyun.com/lx583274568/article/details/75529337

leetCode 专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种求整数补数的有效算法。通过将输入的十进制整数转换为二进制，然后逐位取反再转回十进制，实现对任意正整数补数的计算。示例中给出了输入5和1时对应的补数输出。

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

这道题呢是求补数。

有了之前的经验，我再也不傻傻的自己写2进制和10进制的转化了！

/**
 * @param {number} num
 * @return {number}
 */
var findComplement = function(num) {
    var a=num.toString(2).split("");
    var b="";
    for(var i=0;i<a.length;i++){
        b+=(a[i]==1?0:1);
    }
    return parseInt(b,2);
};

over！

效率还行吧~~