78. 子集

解 递归 dfs 深度优先遍历 class Solution: def subsets(self, nums: List[int]) -> List[List[int]]: result = list() path = list() self.dfs(nums, path, result)

>>阅读原文<<