leetcode-461. Hamming Distance

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

注：
①^按位异或，对应位不同为1，相同为0
②&按位与，对应位都是1则返回1，&1是xxxxxx和0000001按位与
③>>是右移一位