461. Hamming Distance

• Difficulty: Easy

• Topics: Bit Manipulation

• Similar Questions:

  • Number of 1 Bits

  • Total 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, calculate the Hamming distance.

Note:
0 ≤ x, y < 2³¹.

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. </pre> </p>

Solutions:

class Solution {
public:
    int hammingDistance(int x, int y) {
        int diff = x ^ y;
        int count = 0;
        while (diff) {
            diff &= diff - 1;
            ++count;
        }

        return count;
    }
};