Hamming Distance

题目描述

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integersxandy, calculate the Hamming distance.
Note:
0 ≤ x, y < 2^31.

样例

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.

代码实现

class Solution {
    public int hammingDistance(int x, int y) {
       int Distance=0; 
        while ( x != 0 || y != 0 ) {
            //奇偶判断，最后一位是否相同
            if ( x % 2 != y % 2 ) {
                Distance ++;
            }
            //右移一位
            x = x >> 1;
            y = y >> 1;
        }
        return Distance;
    }
}