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.

1 2 3 4 5 6 7 8 9 10 11 12

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