腾讯云·社区
Hamming Distance
1. Description
2. Solution
- 32 times
class Solution {
public:
int hammingDistance(int x, int y) {
int m = x ^ y;
int distance = 0;
while(m) {
distance += m & 1;
m = m >> 1;
}
return distance;
}
};- n times(n is the number of 1)
class Solution {
public:
int hammingDistance(int x, int y) {
int m = x ^ y;
int distance = 0;
while(m) {
m = m & (m - 1);
distance++;
}
return distance;
}
};本文参与腾讯云自媒体分享计划，欢迎正在阅读的你也加入，一起分享。
相关文章
扫码关注云+社区
领取腾讯云代金券
我来说两句