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 ≤ x, y < 2^31.

Example:
Input: x = 1, y = 4
Output: 2

Explanation:

The above arrows point to positions where the corresponding bits are different.

Solution in python:

class Solution:
    def hammingDistance(self, x: int, y: int) -> int:
        v = x^y
        distance = 0
        while v > 0:
            b = v & 1
            distance += b
            v >>= 1
        return distance