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

Credits:
Special thanks to @syedee for adding this problem and creating all test cases.

算法分析：本题有多种方法，最简单的就是上从0到num一个一个算，其计算复杂度为O(n*sizeof(integer))。想要O(n)的解法就要找规律。规律如下：

转换	1的个数	注释
0 -> 0	0
1 -> 01	1	就是把0中位1的个数加上1
2 -> 10	1
3 -> 11	2	就是把0和1中的位1的个数加上1，然后放在2和3上

C语言版

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* countBits(int num, int* returnSize) {
    int *result = (int *)malloc((num + 1) * sizeof(int));
    int i = 1, j, tmp = 1;
    *returnSize = num + 1;
    result[0] = 0;
    while(i <= num)
    {
        for (j = 0; j < tmp && i <= num; i++, j++)
        {
            result[i] = result[j] + 1;
        }
        tmp = tmp << 1;
    }

    return result;
}

Python版

class Solution(object):
    def countBits(self, num):
        """
        :type num: int
        :rtype: List[int]
        """
        res = [0]
        while len(res) <= num:
            res.extend([i+1 for i in res])
        return res[ : num + 1]