class Solution {
public:
int hammingDistance(int x, int y) {
int ans = 0;
for (int i = 0; i < 32;i++)
{
ans += ((x >> i) & 1) ^ ((y >> i) & 1);
}
return ans;
}
};
LeetCode461. 汉明距离
最新推荐文章于 2022-04-23 20:54:08 发布