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 < 2^{31}.$

Example:

1
2
3
4
5
6
7
8
9
10
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.

分析

汉明距离是指两个等长字符串对应位置的不同字符的个数。

解决方案1(Python)

1
2
3
4
5
6
7
8
class Solution(object):
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        return bin(x^y).count("1")

相关问题

题目来源