优化
class Solution {
public:
int hammingDistance(int x, int y) {
int out=0;
x^=y;
while(x){
out+=x&1;
x=x>>1;
}
return out;
}
};
遍历
class Solution {
public:
int hammingDistance(int x, int y) {
int temp=1,out=0;
for(int i=0;i<32;i++){
// cout<<x<<" "<<y<<endl;
if((x&temp)!=(y&temp))out++;
x=x>>1;
y=y>>1;
if(!x&&!y)break;
}
return out;
}
};