leetcode添加元素使和等于
LeetCodeOne
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)
↑
↑
问题
求两个数的二进制表示中，不同位数的个数。
思路
将两个数进行异或
统计异或后的数字中1的个数
C++
class
Solution
{
public:
int
hammingDistance(int
x,
int
y)
{
int
dist
=
0;
int
n
=
x^y;
//异或
while(n)
{
++dist;
n
=
n
评论0
最新资源