LeetCode Number of 1 Bits

最新推荐文章于 2020-10-02 12:52:18 发布

原创最新推荐文章于 2020-10-02 12:52:18 发布 · 1.8k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

LeetCode 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种计算无符号整数二进制表示中1的位数的方法，通过一个具体的C++实现示例解释了如何使用位操作来高效地解决这个问题。

Number of 1 Bits Total Accepted: 10567 Total Submissions: 28552 My Submissions Question Solution
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的个数：

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