Leetcode Hamming distance simple

title ：461 Hamming distance - Simple

subject

Between two integers Hamming distance It refers to the number of different positions of the two numbers corresponding to the binary bits .

Here are two integers x and y, Calculate and return the Hamming distance between them .

Example 1

 Input ：x = 1, y = 4
 Output ：2
 explain ：
1   (0 0 0 1)
4   (0 1 0 0)
       ↑   ↑
 The arrows above indicate different positions of corresponding binary bits .

Example 2

 Input ：x = 3, y = 1
 Output ：1

Tips

• 0 <= x, y <= 231 - 1

Code Java

public int hammingDistance(int x, int y) {
    
    //  obtain  x And y  Different locations 1 The number of 
    int ones = x ^ y;
    //  Calculation ones in 1 The number of 
    int sum = 0;
    while (ones > 0) {
    
        ones &= ones - 1; //  Clear low order 1
        sum ++;
    }
    return sum;
}