leetcode刷题。总结，记录，备忘 191

leetcode191题，求一个32无符号整数中位为1的个数，2种方法，最简单的就是使用c++中bitset容器，直接使用count()这个成员函数即可

class Solution {
public:
    int hammingWeight(uint32_t n) {
        bitset<32> bu(n);
        
        return bu.count();
    }
};

另一种方法使用c语言中的位与操作，和右移操作，将每位与1做位与操作，结果为1的话就让计数器加1，位移31次，做32次位与操作即可

/*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.
 */
# include <stdio.h>

int hammingWeight(unsigned int n) {
    int count = 0;
    int i = 0;
    
    while (i < 31)
    {
        if ((n & 0x00000001) == 1)
			count++;
        n >>= 1;
        i++;
    }
    
    return count;
}

int main(void)
{
	unsigned int n = 11;

	printf("%d\n", hammingWeight(n));
	
	return 0;
}