Hamming Distance LeetCode solution in Java

1
class Solution {
2
  public int hammingDistance(int x, int y) {
3
    int ans = x ^ y;
4
    int count = 0;
5
    while (ans > 0) {
6
      count += ans & 1;
7
      ans >>= 1;
8
    }
9

10
    return count;
11
  }
12
}