461. Hamming Distance
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 ≤
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.
Python 3 Code:
class Solution:
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        z = int (x ^ y)
        ans = 0
        while z > 0:
            ans += z % 2
            z = z >> 1 
        return ans
Comments
Post a Comment