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
andy
, 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.
把两个数异或之后看结果有多少个1.
1 | class Solution { |