461. Hamming Distance

Sterben_Da

于 2022-06-09 16:18:33 发布

阅读量92

点赞数

分类专栏： leetcode-python 文章标签： leetcode python 算法

本文链接：https://blog.csdn.net/Sterben_Da/article/details/125205616

版权

leetcode-python 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

461. Hamming Distance

Easy

3087198Add to ListShare

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, return the Hamming distance between them.

Example 1:

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.

Example 2:

Input: x = 3, y = 1
Output: 1

Constraints:

0 <= x, y <= 231 - 1

class Solution:
    def hammingDistance(self, x: int, y: int) -> int:
        """
        assert Solution().hammingDistance(1, 4) == 2
        assert Solution().hammingDistance(3, 1) == 1
        assert Solution().hammingDistance(37, 8) == 4

        求相同位置二进制位不等的数量
        """

        # result = 0
        # while x > 0 or y > 0:
        #     if x % 2 != y % 2:
        #         result += 1
        #     x >>= 1
        #     y >>= 1

        result = bin(x ^ y).count('1')
        return result