【LeetCode】461. Hamming Distance【E】【90】

最新推荐文章于 2024-10-30 20:07:18 发布

sscssz

最新推荐文章于 2024-10-30 20:07:18 发布

阅读量518

点赞数

分类专栏： leetcode Python 算法位运算文章标签： python string leetcode题解 leetcode 二进制

本文链接：https://blog.csdn.net/sscssz/article/details/55254450

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

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.

Subscribe to see which companies asked this question.

思路很简单，先转成二进制，然后计算异或，然后看一共有多少个1 就是结果了

class Solution(object):
    def hammingDistance(self, x, y):

        return ((bin(x ^ y)[2:])).count('1')

        """
        :type x: int
        :type y: int
        :rtype: int
        """