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.

例如，32位整型11二进制为00000000000000000000000000001011, 所以函数应该返回3。

方法很简单，每次左移一位看是否能为2整除，不能则最右一位为1，代码如下：

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int count=0;
        while(n!=0)
        {
            if(n%2==1) count++;
            n=n>>1;
        }
        return count;
    }
};