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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

思路：

java中如何表示无符号整数呢，很伤，那就用C写吧。二进制与运算和二进制循环移位搞定

代码：

int hammingWeight(uint32_t n) {
    int count=0;
    while(n>0)
    {
        count+=(n&1);
        n=n>>1;
    }
    return count;
}

结果：

leetcode_Number of 1 Bits

原文：http://blog.csdn.net/mnmlist/article/details/44945871