class Solution {
public int hammingDistance(int x, int y) {
int sum=x^y;
int count;
for(count=0;sum>0;count++){
sum&=sum-1;
}
return count;
}
}
class Solution {
public int hammingDistance(int x, int y) {
int sum=x^y;
int count;
for(count=0;sum>0;count++){
sum&=sum-1;
}
return count;
}
}