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 = n & (n - 1); 主要考察对二进制运算的灵活掌握。C++代码如下（以后LeetCode上的题尽量用C++或者Java了:））：

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

        return count;
    }

};