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

代码如下：（找规律）

class Solution:
    def countBits(self, num):
        """
        :type num: int
        :rtype: List[int]
        """
        ret=[0 for i in range(num+1)]
        if num==0:
            ret=[0]
        elif num==1: 
            ret=[0,1]
        else:
            ret[0]=0
            ret[1]=1
            for i in range(2,num+1,1):
                if i==2:
                    ret[i]=1
                    c=2
                elif i%c==0:
                    ret[i]=1
                    c=i
                else:ret[i]=ret[c]+ret[i-c]
        return ret