LeetCode 191 Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).

For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.

AC代码如下：

class Solution {
public://位运算更高效
    int hammingWeight(uint32_t n) {
        int count=0;
        int length=sizeof(n)*8;
        for(int i=0;i<length;++i){
            if(n&1)
                count++;
            n=n>>1;
        }
        return count;
    }
};

看《剑指Offer》，看到更好的解法（对负数同样成立）：

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int count=0;
        while(n){
            count++;
            n=n&(n-1);
        }
        return count;
    }
};