leetcode 338

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.

C++
1、常规
class Solution {
public:
    vector<int> countBits(int num) {
        vector<int >answer;
        for(int i=0;i!=num+1;++i)
            answer.push_back(func(i));
        return answer;
    }
    int func(int n){
        int count = 0;
        while(n){
            count ++;
            n = n&(n-1);
        }
        return count;
    }
};
2、迭代
class Solution {
public:
    vector<int> countBits(int num) {
        vector<int >answer(num+1,0);
        for(int i=0;i!=num+1;++i)
            answer[i]=answer[i>>1]+answer%2;
        return answer;
    } 
};