Subsets

• Difficulty: Medium
• Type: DFS/BFS
• link

Problem

Solution

• Use DFS to update possible subsets
• Stoping condition: starting index is large or equal to the length of nums

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        result = []
        def dfs(start,path):
            if start > len(nums):
                return
            elif start == len(nums):
                result.append(path)
                return

            result.append(path)
            for i in range(start,len(nums)):
                dfs(i+1,path+[nums[i]])

        dfs(0,[])
        return result