Hamming Distance.md

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.

My code:

class Solution(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        x,y=(x,y) if x<y else (y,x)
        dist = 0
        while x != 0 and x != 0:
            if x % 2 != y % 2:
                dist += 1
            x = x>>1
            y = y>>1
            
        while y != 0:
            if y % 2 != 0:
                dist += 1
            y = y>>1    
                
        return dist
            
        

Solution: https://leetcode.com/problems/hamming-distance/