461. Hamming Distance

Question 461

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.

Example

Input: x = 1, y = 4

Output: 2

Explanation:
1   (0 0 0 1)
4   (0 1 0 0)
       ↑   ↑

Answer

class Solution:
    def hammingDistance(self, x, y):
    
        result = x^y
        return bin(result).count('1')
        """
        :type x: int
        :type y: int
        :rtype: int
        """