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

思路：

整数转换为二进制后1的个数的变化其实很有规律，只需找到这个规律：

 sol[i] = sol[i/2] + (i%2);

上式表示整数 i 中1的个数等于整数 i / 2 中1的个数再加上 ( i % 2 ) 。

代码：

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> sol(num+1);
        sol[0]=0;
        for (int i=1; i <= num ; i++) {
            sol[i] = sol[i/2] + (i%2);
        }
        return sol;
   }
};