class Solution {
public int hammingDistance(int x, int y) {
int num = 0;
int temp = x^y;
while (temp != 0) {
temp = (temp - 1) & temp;
num++;
}
return num;
}
}
leetcode:20.汉明距离 简单
最新推荐文章于 2024-05-20 15:46:19 发布