[leetcode]78. Subsets

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        result = []
        def dfs(index,path) :
            result.append(path)
            for i in range(index, len(nums)):
                dfs(i + 1,path + [nums[i]])     
        dfs(0,[])
        return result