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的個數就好了，1行程式碼

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