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:
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.
|
思路
这道题是非常简单的。把两个数按位异或，统计结果中bit当中1的个数即可。
1 2 3 4 5 6 7 8 9 10 11 12 13 14
|
class (object): def hammingDistance(self, x, y): """ :type x: int :type y: int :rtype: int """ result = x^y i = 0 while(result): if (result % 2 == 1): i = i + 1 result = result / 2 return i
|
近期评论