题目描述
https://leetcode-cn.com/problems/hamming-distance/
思路题解
先求出两个数的二进制(此时返回值为str
类型),再转int,再求异或,再转二进制,再count
里面'1'
的个数
class Solution:
def hammingDistance(self, x: int, y: int) -> int:
return bin(int(bin(x),2)^int(bin(y),2)).count('1')