原题
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.
解法
将数字转化为32位二进制字符串, 左边填充’0’, 然后按位进行比较.
代码
class Solution(object):
def hammingDistance(self, x, y):
"""
:type x: int
:type y: int
:rtype: int
"""
bi_x = '{:0>32s}'.format(bin(x)[2:])
bi_y = '{:0>32s}'.format(bin(y)[2:])
count = 0
for i in range(1, len(bi_x)):
if bi_x[i]!= bi_y[i]:
count += 1
return count