问题描述:
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.
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的个数。
过程详见代码:
class Solution {
public:
int hammingDistance(int x, int y) {
int res = x ^ y;
int count = 0;
while(res > 0)
{
count += res & 1;
res >>= 1;
}
return count;
}
};