leetcode-python经典题之汉明距离

class Solution(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        lx = []
        while True:
            x, rx = divmod(x, 2)
            lx.append(rx)
            if x == 0:
                break
        ly = []
        while True:
            y, ry = divmod(y, 2)
            ly.append(ry)
            if y == 0:
                break
        lx.reverse()
        ly.reverse()
        res = 0
        if len(lx) > len(ly):
            ly = [0]*(len(lx)-len(ly))+ly
            for i in range(len(ly)):
                if ly[i] != lx[i]:
                    res += 1
        else:
            lx = [0]*(len(ly)-len(lx))+lx
            for i in range(len(lx)):
                if lx[i] != ly[i]:
                    res+=1
        print res
        return res