LeetCode 461. Hamming Distance

Total Accepted: 40424
Total Submissions: 57153
Difficulty: Easy
Contributors: Samuri

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.

又开始刷题了O(∩_∩)O哈哈~
class Solution(object):
def hammingDistance(self, x, y):
"""
:type x: int
:type y: int
:rtype: int
"""
count = 0
while x != 0 or y != 0:
a = x & 1
b = y & 1
if a != b:
count += 1
x = x >> 1
y = y >> 1
return count