[💕 LeetCode Python] 461. Hamming Distance

---

✍461. Hamming Distance✍

---

문제

leetcode.com/problems/hamming-distance/

Hamming Distance - LeetCode

내 답

def hammingDistance(self, x: int, y: int) -> int:
	# xor은 같으면 0, 다르면 1이므로 1의 갯수를 센다.
        return bin(x^y).count('1') 

 

풀이

내 답이랑 똑같음