【leetcode】位1的个数

 

int hammingWeight(uint32_t n) {
    int count=0;
    while(n)
    {
        if(n & 1) count++;
        n >>= 1;
    }
    return count;
}