LeetCode: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.

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.
代码：
使用异或可以得到二进制上位不相同的值为1，然后使用n&(n-1)的方式可以每次除掉n二进制上的最后一位1。

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