【LeetCode】461. Hamming Distance【E】【90】

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.
Subscribe to see which companies asked this question.思路很简单，先转成二进制，然后计算异或，然后看一共有多少个1 就是结果了 
class Solution(object):    def hammingDistance(self, x, y):        return ((bin(x ^ y)[2:])).count('1')        """        :type x: int        :type y: int        :rtype: int        """