使用列表推导和递归的列表所有子集的Python Sum

Question

I'm trying to write a program that returns set of all subset sum of a list. I must use list comprehension and recursion.

Example:

[1,2,3,10]
return set([0,1,2,3,4,5,6,100,101,102,103,104,105,106])

I write code:

def function(L):
    if len(L) == 0:
        return []
    return list((L[index] + rest) for index in range(len(L)) for rest in function(L[:index])+L[index+1:])

This code returns sum of subsets but only 2 or more elemental subset.
Example
[1,2,3,4,100]
return [3,4,5,6,101,102,103,104,105,106]

Answer 1

This is change that seems to yield the right answer:

def function(L):
 if len(L) == 0:return []
 return L+list((L[index] + rest) for index in range(len(L)) for rest in function(L[:index])+L[index+1:])