leetcode-- 338. Counting Bits

最新推荐文章于 2023-09-01 09:52:28 发布

名字被猪吃掉了

最新推荐文章于 2023-09-01 09:52:28 发布

阅读量107

点赞数

分类专栏： leetCode 反复看

本文链接：https://blog.csdn.net/hhuzxx/article/details/93308785

版权

反复看同时被 2 个专栏收录

110 篇文章 1 订阅

订阅专栏

leetCode

64 篇文章 0 订阅

订阅专栏

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 1:

Input: 2
Output: [0,1,1]
Example 2:

Input: 5
Output: [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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/counting-bits
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

我的思路：

1. dp[i]表示数字 i 的 1 的个数

2. dp[i] = dp[i/2] + i%2;

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> dp(num+1);
        dp[0] = 0;
        for(int i =1; i <= num; i++){
            dp[i] = dp[i/2] + i%2;
        }
        return dp;
    }
};