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.

答案：

求一个数字二进制形式时的汉明权重，也就是里面有多少个1

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