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.

分析：

每次把1 左一i位与原数相与，为零不是1，非零为1

代码：

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int mask=1;
        int res=0;
        for(int i=0; i<32; i++)
        {
            mask=1<<i;
            if(mask&n)
            res++;
        }
        return res;
    }
};