new_contents: """Leetcode 461. Hamming Distance
  
  URL: https://leetcode.com/problems/hamming-distance/description/
  
  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.
  """
  
  class Solution(object):
      def hammingDistance(self, x, y):
          """
          :type x: int
          :type y: int
          :rtype: int
          """
          return bin(x ^ y).count('1')
  
  
  def main():
      print Solution().hammingDistance(1, 4)
  
  if __name__ == '__main__':
      main()
  
subject: Complete lc461_hamming_distance.py