LeetCode 338 Counting Bits (递推)

最新推荐文章于 2021-06-03 00:28:07 发布

_TCgogogo_

最新推荐文章于 2021-06-03 00:28:07 发布

阅读量662

点赞数

分类专栏： Leetcode Medium LeetCode 文章标签： leetcode dp

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/52370372

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 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:
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.

题目链接：https://leetcode.com/problems/counting-bits/

题目分析：直接递推即可，若当前数字是奇数，其二进制中1的个数相当于它右移一位的那个数中1的个数加1，偶数则不加1

public class Solution {
    public int[] countBits(int num) {
        int[] dp = new int[num + 1];
        Arrays.fill(dp, 0);
        dp[0] = 0;
        for(int i = 1; i <= num; i ++) {
            dp[i] += dp[i >> 1] + (i & 1);
        }
        return dp;
    }
}