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

脑筋急转弯：给一个非负数num，以数组形式输出for i in range（num+1）范围内，i的二进制形式中数字1的个数…*

answer with python :

class Solution(object):
    def countBits(self, num):
        """
        :type num: int
        :rtype: List[int]
        """
        iniArr = [0]

        if num > 0:
            while len(iniArr) < num + 1:
                iniArr.extend([x+1 for x in iniArr])

        return iniArr[0:num+1]