461. Hamming Distance
—Easy
https://leetcode.com/problems/hamming-distance/
Code:
class Solution: def hammingDistance(self, x: int, y: int) -> int: ans = 0 X = list(map(int,list(bin(x).replace('0b','')))) Y = list(map(int,list(bin(y).replace('0b','')))) length = max(len(X),len(Y)) if len(X) < length: X = [0]*(length-len(X))+X else: Y = [0]*(length-len(Y))+Y Z = X + Y for i in range(length): if X[i]+Y[i] == 1: ans += 1 return ans # s = Solution() # print(s.hammingDistance(x = 1, y = 4))
思路:
1.解题时不支持numpy
2.map的应用
3.bin的应用