LeetCode 191 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.

计算无符号整数n的二进制表示下的1的个数

C语言版：

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

LeetCode 191 Number of 1 Bits

标签：

原文地址：http://blog.csdn.net/hpuhjl/article/details/44754211