[LeetCode] #461. Hamming Distance

Input: x = 1, y = 4Output: 2Explanation:
1 (0 0 0 1)
4 (0 1 0 0)
↑ ↑
The above arrows point to positions where the corresponding bits are different.
class Solution:
def hammingDistance(self, x: int, y: int) -> int:
sum=0
xy=bin(x^y)
number_xy=xy[2:]
for i in number_xy:
sum+=int(i)
return sum

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store