题目
解题思路
这道题就是要比较2个数字二进制形式有多少位不同,一开始想用循环解决,后来突然发现这题目不就是位运算题目嘛~
具体代码
class Solution {
public:
int hammingDistance(int x, int y) {
int diff = x ^ y;
int counter = 0;
while (diff) {
if (diff % 2)
counter++;
diff = diff >> 1;
}
return counter;
}
};
ps: 有好一段时间没去看leetcode了,突然发现上面新增了好多easy的题目……= =