LeetCode 之 Number of 1 Bits — C 实现

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’的个数（汉明距离）。

例如，32位整数‘11’二进制表示为 00000000000000000000000000001011，函数应返回 3。

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