[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 < 2^31

题目这么简单，一行代码就搞定了：

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