Hamming Distance–LeetCode#461

461.Longest Common Prefix

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.

(求两个数的汉明距离，)

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 HammingDistance {
    public int hammingDistance(int x, int y) {
        return Integer.bitCount(x ^ y);
    }
    public static void main(String[] args) {
        HammingDistance hammingDistance = new HammingDistance();
        System.out.println(hammingDistance.hammingDistance(93,73));
    }
}