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.
Subscribe to see which companies asked this question.
class Solution(object):
def hammingDistance(self, x, y):
self.x = x
self.y = y
return bin(self.x ^ self.y).count('1')
#求二进制不同的位置
总结:
^ 相同位置为零不同位置为一
bin()返回的是字符串
count("char") 返回字符char的个数