Leetcode 461 Hamming Distance

Leetcode 461 Hamming Distance

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