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.

Code (Java):

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

class Solution {     public int hammingDistance(int x, int y) {         // step 1: get xor for x and y         //         int xorNum = x ^ y;                   // step 2: check how many bit 1s in the xorNum         //         int mask = 1;         int distance = 0;                             for (int i = 0; i < 32; i++) {             distance += xorNum & mask;             xorNum = xorNum >> 1;         }                   return distance;     } }