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的个数。

思路：n&1即返回n的最低位，然后n = n>>1，再查看次低位。

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