Description
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.
Solution
Bit manipulation
可以逐個(gè)位取異或，也可以整個(gè)取異或然后count 1 bit。
class Solution {
public int hammingDistance(int x, int y) {
int xor = x ^ y;
int dis = 0;
for (int i = 0; i < 32; ++i) {
dis += xor & 1;
xor >>= 1;
}
return dis;
}
}
