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 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.

题目大意：

一道很有意思的题目，计算从0到n，每个数的二进制中“1”的位数，要求时间复杂度O(n)。把0-15的二进制位数写出来，如下：
【0、1、1、2、1、2、2、3、1、2、2、3、2、3、3、4】，发现可以构造成一棵二叉树，把这棵树打印出来即可。（树根从1开始，如果左孩子的值等于父节点，右孩子的值等于父节点+1）

class Solution {
    public int[] countBits(int num) {
        int[] result = new int[num+1];
        if(num >= 0) {
            result[0] = 0;    
        }
        if(num >= 1) { // 为树根赋值
            result[1] = 1;    
        }
        for(int i = 2; i <= num; i++) {
            if(i % 2 == 0) {
                result[i] = result[i/2];
            }else {
                result[i] = result[i/2] + 1;
            }
        }
        return result;
    }
}