[leetcode 191]Number of 1 Bits

最新推荐文章于 2022-11-15 10:09:16 发布

原创最新推荐文章于 2022-11-15 10:09:16 发布 · 291 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #位操作

C语言专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一个C++实现的方法，用于计算一个无符号整数中二进制表示里1的个数（即汉明重量）。通过一个具体的例子展示了如何逐位检查并累加1的个数。

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.

class Solution {
public:
    int hammingWeight(uint32_t n) {
        unsigned int count =0; 
        while(n)
        {
            //n = n&(n-1);
            //count++;
            count += n&1;
            n = n>>1;
        }
        return count;
    }
};