LeetCode 338. Counting Bits

338. Counting Bits

Medium

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.

题意

给定一个正整数num，求1-num之间各个数的二进制表示中1的个数

思路

算是动态规划吧。递推式：
bits[i] = 1 + bits[i - maxbit]

代码

class Solution {
    public int[] countBits(int num) {
        int[] bits = new int[num + 1];
        int i = 0, bit = 1;
        while (i <= num) {
            for (i=bit; i<(bit<<1) && i<=num; ++i) {
                bits[i] = 1 + bits[i - bit];
            }
            bit <<= 1;
        }
        return bits;
    }
}