LEETCODE 191

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.

思路：

这个题在选择题中很常见，n&(n-1)的循环调用，可以统计二进制中“1”的个数，同时n&（n-1）==0，可以判断n为2的次幂

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