Hamming Distance LeetCode solution in C++

1
class Solution {
2
public:
3
int hammingDistance(int x, int y) {
4
int res = 0;
5
int num = x ^ y;
6
while (num) {
7
res += num % 2;
8
num >>= 1;
9
}
10
return res;
11
}
12
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0