461. Hamming Distance

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.

Note:
0 ≤ x, y < 231.

Example:

Input: x = 1, y = 4Output: 2Explanation: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 z = x^y; //先做异或，再检查有多少个1        int res = 0;        while(z != 0){            if((z&1) == 1){                res++;            }            z = z >> 1;        }        return res;    }}