461. Hamming Distance

最新推荐文章于 2021-07-24 15:31:44 发布

原创最新推荐文章于 2021-07-24 15:31:44 发布 · 193 阅读

0 ·

CC 4.0 BY-SA版权

Python 同时被 2 个专栏收录

78 篇文章

订阅专栏

Leetcode

43 篇文章

订阅专栏

本文介绍了一种计算两个整数之间汉明距离的方法，即比较两个整数对应的二进制位中不同位的数量。通过使用异或运算和二进制字符串处理，文章提供了一个简洁的Python实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 < 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.

class Solution:
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        count=0
        for item in bin(x^y)[2:]:
                if item=='1':
                    count=count+1
        return count

用到了异或，和截取字符串