[LeetCode]Hamming Distance

题目描述:

LeetCode 461. Hamming Distance

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.

题目大意:

两个整数的汉明距离是指其二进制不相等的位的个数。

给定两个整数x和y,计算汉明距离。

注意:

0 ≤ x, y < 2^31.

解题思路:

异或运算

Python代码:

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

 

本文链接:http://bookshadow.com/weblog/2016/12/18/leetcode-hamming-distance/
请尊重作者的劳动成果,转载请注明出处!书影博客保留对文章的所有权利。

如果您喜欢这篇博文,欢迎您捐赠书影博客: ,查看支付宝二维码