LeetCode 第 338 题 (Counting Bits)

最新推荐文章于 2021-12-23 02:03:37 发布

liyuanbhu

最新推荐文章于 2021-12-23 02:03:37 发布

阅读量2.1k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：数据结构与算法 leetCode 试题分析与解答文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/liyuanbhu/article/details/51187553

数据结构与算法同时被 2 个专栏收录

51 篇文章

订阅专栏

leetCode 试题分析与解答

33 篇文章

订阅专栏

本文详细介绍了LeetCode第338题的解题思路，即计算给定整数范围内每个数的二进制表示中1的数量，并通过代码实现优化，达到线性时间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LeetCode 第 338 题 (Counting Bits)

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.

Example:
For num = 5 you should return [0,1,1,2,1,2].

Follow up:
It is very easy to come up with a solution with run time O(n*sizeof(integer)). But can you do it in linear time O(n) /possibly in a single pass?
Space complexity should be O(n).
Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.

这道题也不难，计算一个数的 1 的位数时可以借用以前计算过的结果。下面是代码

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> ret;
        ret.push_back(0);
        for(int i = 1; i <= num; i++)
        {
            int bits = ret[i >> 1] + (i & 1);
            ret.push_back(bits);
        }
        return ret;
    }
};