【leetcode】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，只需要判断该位与1与以后是不是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; 
    }
};

注意基本的位操作