461. Hamming Distance

最新推荐文章于 2023-12-18 09:47:53 发布

onefanyf

最新推荐文章于 2023-12-18 09:47:53 发布

阅读量60

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_34471804/article/details/101006266

版权

leetcode 专栏收录该内容

77 篇文章 0 订阅

订阅专栏

#461. Hamming Distance

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, calculate the Hamming distance.

Example:
nput: x = 1, y = 4
Output: 2
Explanation:
1 (0 0 0 1)
4 (0 1 0 0)
↑ ↑
The above arrows point to positions where the corresponding bits are different.

首先用toString(2)将数字转换成二进制字符串。然后检查两个数的位数，在前面补零，然后比较两个数相同位置的字符。

var hammingDistance = function(x, y) {
    var xString=x.toString(2);
    var yString=y.toString(2);
    var result=0;
    if(xString.length>yString.length) {
        for(var i=yString.length;i<xString.length;i++) {
            yString="0"+yString;
        } 
        for(var j=0;j<xString.length;j++) {
            if(xString[j]!==yString[j]) {
                result++;
            }
        }
    }
    else {
        for(var i=xString.length;i<yString.length;i++) {
            xString="0"+xString;
        } 
        for(var j=0;j<xString.length;j++) {
            if(xString[j]!==yString[j]) {
                result++;
            }
        }
    }
    return result;
};