leetcode: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.
Show Hint
Credits:
Special thanks to @ syedee for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

给出一个范围的数字，求出一系列范围内的1的个数
简单动态规划题目，对于数字a，a
num[a] = num[a/2] + a %2

public class Solution {
    public int[] countBits(int num) {
        int[] ans = new int[num + 3];
        ans[0] = 0;
        ans[1] = 1;
        ans[2] = 1;
        for(int i = 3; i <= num; ++i){
            int a = i % 2;
            ans[i] = ans[i / 2] + a;
        }

        return Arrays.copyOf(ans, num + 1);
    }
}