【leetcode】二进制中1的个数

 

int hammingWeight(uint32_t n) {
    int res = 0;

    while (n != 0) {
        n = n & (n - 1);
        res++;
    }

    return res;
}