<LeetCode>Algorithms-Easy

最新推荐文章于 2024-09-09 22:01:06 发布

DaxinPai

最新推荐文章于 2024-09-09 22:01:06 发布

阅读量216

点赞数

分类专栏： algorithm 文章标签： leetcode

本文链接：https://blog.csdn.net/u013036695/article/details/74020953

版权

algorithm 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

461. Hamming Distance
- Description:
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.

class Solution(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        self.x = x
        self.y = y
        self.z = self.x ^ self.y
        return bin(self.z).count('1')

Runtime: 33 ms
Beat 98.14%