461. Hamming Distance - LeetCode Solution

class Solution:
    def hammingDistance(self, x: int, y: int) -> int:
        
        x = bin(x)
        y = bin(y)
        x = x[2:]
        y = y[2:]


        a = [0] * 32
        b = [0] *32

        for i in range(len(x)):
            a[len(a) - i -1] = int(x[len(x) - i - 1])


        for i in range(len(y)):
            b[len(b) - i -1] = int(y[len(y) - i -1])



        count = 0

        for i in range(len(a)):
            if a[i] != b[i]:
                count+=1
                
                
        return count