位运算（1）——Hamming Distance

https://leetcode.com/problems/hamming-distance/#/description

输入：两个整数x，y，且0 ≤ x, y < 2³¹。

输出：x，y的二进制表示，不同的有几位。

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.

 public class Solution {
     public int hammingDistance(int x, int y) {
         int count = 0;
         for(int i=0; i<32; i++) {
             if((x & 1) != (y & 1)) {
                 count++;
                 x = x >> 1;
                 y = y >> 1;
             } else {
                 x = x >> 1;
                 y = y >> 1;
             }
         }
         return count;
     }
 }