# Hamming Distance

Nov 22, 2017

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.

int hammingDistance(int x, int y) {
int t = x^y;
int ret = 0;
while(t!=0) {
ret += (t&1);
t >>= 1;
}
return ret;
}

LeetCodeLeetCode

Counting Bits

Find the Duplicate Number