78. Subsets

solution.py

class Solution:
    def depth_first_search(self, nums: List[int], curr_state: List[int], curr_idx: int):
        if curr_idx == len(nums):
            self.final_result.append(curr_state.copy())
            return
    
        num = nums[curr_idx]
        curr_state.append(num)
        self.depth_first_search(nums, curr_state, curr_idx + 1)
        curr_state.pop()
        self.depth_first_search(nums, curr_state, curr_idx + 1)

    def subsets(self, nums: List[int]) -> List[List[int]]:
        self.final_result = list()
        self.depth_first_search(nums, list(), 0)
        return self.final_result