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.
python3:
1 class Solution: 2 def hammingDistance(self, x: int, y: int) -> int: 3 tmp = x ^ y 4 rst = bin(tmp).count('1') 5 return rst