Hamming Distance

Problem

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, return the Hamming distance between them.

Example 1:

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.

Example 2:

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

Constraints:

• 0 <= x, y <= 2^31 - 1

Code

C++

class Solution {
public:
    int hammingDistance(int x, int y)
    {
        if (x == y)
            return 0;
        if (x < y)
        {
            int temp = 0;
            temp = x;
            x = y;
            y = temp;
        }

		int cnt = 0;
        while (y >= 1)
        {
            if ((y % 2) != (x % 2))
            {
                cnt++;
            }
            y /= 2;
            x /= 2;
        }
        while (x >= 1)
        {
            cnt = (x % 2 == 1) ? cnt + 1 : cnt;
            x /= 2;
        }
        return cnt;
    }
};