LeetCode 461 Hamming Distance（汉明距离）

Q:The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.
注：两个等长字符串之间的汉明距离（英语：Hamming distance）是两个字符串对应位置的不同字符的个数。换句话说，它就是将一个字符串变换成另外一个字符串所需要替换的字符个数。
Note:
0 ≤ x, y < 231.
Example:

Input: x = 1, y = 4
Output: 2

Explanation:
1 (0 0 0 1)
4 (0 1 0 0)
The above arrows point to positions where the corresponding bits are different

S:
public class Solution {

      public int hammingDistance(int x, int y) {
          return Integer.bitCount(x ^ y);
      }

}

bitCount 自实现方案：

              int d = 0;
    int bitxor = x ^ y;
     while (bitxor > 0){
        if (bitxor % 2 == 1){
            d++;
        }
        bitxor = bitxor >> 1;
    }
    return d;