LeetCode 461. Hamming Distance

最新推荐文章于 2022-08-02 17:24:01 发布

原创最新推荐文章于 2022-08-02 17:24:01 发布 · 867 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

算法同时被 2 个专栏收录

141 篇文章

订阅专栏

LeetCode

129 篇文章

订阅专栏

本文介绍了一种计算两个整数间汉明距离的方法。汉明距离是指两个整数对应的二进制位中不同位的数量。文章提供了一个Python实现的例子，演示了如何通过异或运算和位操作来计算这一距离。

Problem Statement

(Source) 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:
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(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        return bin(x ^ y).count('1')