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;
}

結果：