LeetCode191——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.

难度系数：

容易

实现

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

LeetCode191——Number of 1 Bits

原文：http://blog.csdn.net/booirror/article/details/44218887