Easy-2

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³¹.

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.

AC:

int hammingDistance(int x, int y) {
    int z=x^y;
    int result=0;
    while(z!=0)
    {
        if(z%2==1)
        {
            result++;
        }
        z/=2;
    }
    return result;
}

tips:

两数异或（^），对得到的数的二进制数1。