Leetcode 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 = 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(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        count = 0
        while x != 0 or y != 0:
            if x & 1 != y & 1:
                count += 1
            x >>= 1
            y >>= 1
        return count

思路：

    当输入x和y都不为0时，若他们交1为0，则最后一位为0，否则为1，判断x和y最后一位是否相同，然后将两个数向右移一位，重复步骤直到都为0。