[리트코드 leetcode] 78. Subsets

leetcode.com/problems/subsets/

Subsets - LeetCode

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        result = []
        
        def dfs(path, lst):
            result.append(path)
            
            if not lst:
                return
        
            for num in lst:
                dfs(path+[num], lst[lst.index(num)+1:])
                
        dfs([],nums)
        return result