LeetCode | Counting Bits

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

Solution 1:
遍历数字0 - num的每个bit位, 复杂度为 O(n*sizeof(integer)).

// O(n*sizeof(integer))
vector<int> countBits(int num) {

    vector<int> ans(num+1, 0);
    for (int i = 1; i <= num; ++i){
        int tmp = i;
        while(tmp){
            ans[i]+=(tmp%2);
            tmp/=2;
        }
    }
    return ans;
}

Solution 2:
用ans表示状态，即第i个数字中bit位为1的数目。考虑数字的二进制表示 0, 1, 10, 11, … , 100, 101, 110, … 可以看到一个数字bit为1的数目为最高位变为0时的数字bit为1的数目加一，也就是状态迁移。时间复杂度为O(n).

// O(n)
vector<int> countBits(int num) {

    vector<int> ans(num+1, 0);
    int level = 2, elem = 1;
    while (elem <= num){
        ans[elem] = 1;
        elem++;
        for (; elem < level && elem <= num; elem++){
            ans[elem] = ans[elem%(level/2)] + 1;
        }
        level *= 2;
    }
    return ans;
}