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.

代码如下: 3ms 

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

　　

转载于:https://www.cnblogs.com/gtxvs/p/7985891.html