leetcode 461. 汉明距离 easy
题目描述:
解题思路:
异或, 然后n&(n-1)把最后一个1变为0来统计1的个数
代码:
//
class Solution {
public:
int hammingDistance(int x, int y) {
int cur = x^y;
int res = 0;
while(cur){
res += 1;
cur = cur &(cur-1);
}
return res;
}
};