问题:
这道问题实际上是求两个数里1不一样的位数。我一开始的答案是如下:
class Solution {
public:
int hammingDistance(int x, int y) {
int flag = 1;
int count = 0;
for(int i = 0;i<32;++i)
{
if((x&flag)!=(y&flag))
count+=1;
flag<<=1;
}
return count;
}
};
但发现这种做法效率很低,于是看了看最快的答案
class Solution {
public:
int hammingDistance(int x, int y) {
return __builtin_popcount(x^y);
}
};
看到这里,其实我的答案还能优化,没必要每次都计算两个数,计算一个数字就够了,于是改成下面的答案,成功跻身第一梯队。
class Solution {
public:
int hammingDistance(int x, int y) {
int flag = 1;
int count = 0;
x = x^y; //加了个异或
for(int i = 0;i<32;++i)
{
if(x&flag)
count+=1;
flag<<=1;
}
return count;
}
};
除了以上的方法,还有一种叫查表法,以下借鉴了博客https://www.cnblogs.com/graphics/archive/2010/06/21/1752421.html
//建表法代码
class Solution {
public:
int hammingDistance(int x, int y) {
int table[256] = {0};
for(int i = 0;i<256;++i)
table[i] = (i&1) + table[i/2];
x = x^y;
unsigned char* p = (unsigned char*) &x;
return table[p[0]]+table[p[1]]+table[p[2]]+table[p[3]];
}
};