LeetCode-Hamming Distance

Description：
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.

题意：计算给定的两个整数的Hamming distance；

解法：Hamming distance的定义是两个数的二进制表示中，相应位不同的个数（即其中一个当前位为1，另外一个为0）；我们只需要将两个整数进行异或操作，那么最后可以得到他们之间不同的那个位，即为1的那个位；

class Solution {
    public int hammingDistance(int x, int y) {
        int dif = x ^ y;
        int cnt = 0;
        while (dif > 0) {
            cnt = dif % 2 == 1 ? cnt + 1 : cnt;
            dif /= 2;
        }
        return cnt;
    }
}