解法一:
class Solution {
public:
int hammingDistance(int x, int y) {
int z=x^y;
int count=0;
while(z)
{
++count;
z=z&(z-1);
}
return count;
}
};
解法二:
class Solution {
public:
int hammingDistance(int x, int y) {
int z=x^y;
int count=0;
for(int i=0;i<32;++i)
{
count+=(z>>i)&1;
}
return count;
}
};