Hamming Distance

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.

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.

Solution

class Solution:
    def hammingDistance(self, x: int, y: int) -> int:
        return bin(x^y)[2::].count('1')
上一篇:YOLOv4论文翻译


下一篇:14.5.3 Locks Set by Different SQL Statements in In