Minimum Bit Flips to Convert Number LeetCode solution in Java

1
class Solution {
2
  public static int minBitFlips(int a1, int a2) {
3
    int n = (a1 ^ a2);
4
    int res = 0;
5
    while (n != 0) {
6
      res++;
7
      n &= (n - 1);
8
    }
9
    return res;
10
  }
11
}