Leetcode461. Hamming Distance不要太简单哦

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 = 4Output: 2Explanation:1   (0 0 0 1)4   (0 1 0 0)       ↑   ↑The above arrows point to positions where the corresponding bits are different.

class Solution {
public:
    int hammingDistance(int x, int y) {
int num = 0;
for (int i = 0; i < 32; i++)
{
int val = 1 << i;
if (val > x && val > y) {
break;
}
  if ((x & val) != (y & val)) {
num++;
}
}
return num;
}
};