LeetCode-Java-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 < 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;while(x!=0||y!=0){if(x%2!=y%2)num++;x>>=1;y>>=1;}return num;}
}