/*****************************************************问题描述*************************************************
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.
Note:
0 ≤ x, y < 231.
Example:
Input: 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.
给定两个整数,求它们对应的二进制数中不一样的位数
/*****************************************************我的解答*************************************************
/**
* @param {number} x
* @param {number} y
* @return {number}
*/
var hammingDistance = function(x, y) {
//把一个整数减去1之后再和原来的整数做位与运算,得到的结果相当于是把整数的二进制表示中的最右边一个1变成0。
var countOfOne = function(n){
var count = 0;
while (n > 0)
{
count++;
n = (n - 1) & n;
}
return count;
};
return countOfOne(x ^ y);
};
leetCode刷题记录58_461_Hamming Distance
猜你喜欢
转载自blog.csdn.net/gunsmoke/article/details/88946561
今日推荐
周排行