Leetcode 461. Hamming Distance

Problem

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, return the Hamming distance between them.

Algorithm

Use xor to compute the differing bits, then count them.

Code

class Solution:
    def hammingDistance(self, x: int, y: int) -> int:
        xy = x^y
        ans = 0
        while xy:
            ans += xy % 2
            xy //= 2
        return ans