461. Hamming Distance

hamming_distance.py

def hammingDistance(x, y):
    xor = '{0:32b}'.format(x ^ y)
    count = 0
    for x in xor:
        if x == "1":
            count += 1

    return count

print(hammingDistance(1, 4))

"""
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.

"""