從今天開始每天用python做幾道leetcode的題目練手，從easy到hard遞進。

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.

兩個integer的漢明距離就是二進位制下對應位置不相同的數目。用^運算子後在count 1 的數量即可。

class Solution(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        return
 
 "{0:b}".format(x^y).count("1")