LeetCode-461-汉明距离
思路
异或,计算1的个数即可
代码
//直接调用bitcount,不推荐
public int hammingDistance(int x, int y) {
return Integer.bitCount(x^y);
}
//异或,计算1
public int hammingDistance(int x, int y) {
int cnt=0;
int s=x^y;
while(s!=0){
cnt+=s&1;
s=s>>1;
}
return cnt;
}