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.
题目解释:Hamming Distance 即为x、y二进制对应位不相同的个数。
解题思路:
x、y不相同的位进行异或运算后为1,再计算异或结果中1的个数,即可得到x、y的hamming Distance。
代码如下:
int hammingDistance(int x, int y) {
int count=0;
x=x^y;
while(x){
count++;
x=x&(x-1);
}
return count;
}