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.首先用x ^ y找出不同的位,再用n & (n - 1)来统计1的位数。代码如下:
public class Solution {
public int hammingDistance(int x, int y) {
int count = 0;
x = x ^ y;
while (x != 0) {
x = x & (x - 1);
count ++;
}
return count;
}
}