[leetcode]Subsets @ Python

原題地址：https://oj.leetcode.com/problems/subsets/

題意：枚舉所有子集。

解題思路：碰到這種問題，一律dfs。

代碼：

class Solution:
    # @param S, a list of integer
    # @return a list of lists of integer
    
    def subsets(self, S):
        def dfs(depth, start, valuelist):
            res.append(valuelist)
            if depth == len(S): return
            for i in range(start, len(S)):
                dfs(depth+1, i+1, valuelist+[S[i]])
        S.sort()
        res = []
        dfs(0, 0, [])
        return res