461. Hamming Distance

class Solution 
{
public:
    int hammingDistance(int x, int y) 
    {
        int z=x^y;
        int count=0;
        while(z)
        {
            count+=(z&1);
            z>>=1;
        }
        return count;
    }
};

异或一下，统计结果中为1的位数