### 题目

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.

### 利用^抵消相同项

#### 代码

public class Solution {
public int hammingDistance(int x, int y) {
int mix = x ^ y;
int count = 0;
while (mix != 0) {
mix = mix & (mix - 1);
++count;
}
return count;
}
}


#### 用Integer.bitCount()

public class Solution {
public int hammingDistance(int x, int y) {
return (Integer.bitCount(x ^ y));
}
}