461. Hamming Distance

461. 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 < 2³¹.

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.

说明：依次判断即可。

int hammingDistance(int x, int y) {        int cnt=0;       while(x||y)       {          if((x&1)^(y&1))          cnt++;          x>>=1;          y>>=1;       }       return cnt;    }