Leetcode-Algorithms Hamming Distance(汉明距离）

从今天开始每天用python做几道leetcode的题目练手，从easy到hard递进。

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.

两个integer的汉明距离就是二进制下对应位置不相同的数目。用^运算符后在count 1 的数量即可。

class Solution(object):
def hammingDistance(self, x, y):
"""
:type x: int
:type y: int
:rtype: int
"""
return "{0:b}".format(x^y).count("1")