解
递归
dfs 深度优先遍历
class Solution:
def subsets(self, nums: List[int]) -> List[List[int]]:
result = list()
path = list()
self.dfs(nums, path, result)
return result
def dfs(self, nums, path, result):
result.append(path)
for i in range(len(nums)):
# nums[i+1:]保证不重复
self.dfs(nums[i + 1:], path + [nums[i]], result)