每日一道Leetcode -子集问题 【递归｜DFS｜回溯】

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        if not nums: return []
        res = []
        def backtrack(i,track):
            # print(res)
            # print(track)
            # 这里一定要使用copy(),不然会随着track的改变而改变
            res.append(track.copy())
            for k in range(i,len(nums)):
                track.append(nums[k])
                backtrack(k+1,track)
                track.pop()
            # print(res)
        sub_track = []
        backtrack(0,sub_track)
        return res

class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
        # 数组包含重复元素
        def backtrack(begin,path):
            res.append(path[:])
            for i in range(begin,size):
                # 先判断当前数字和前面是否一样，一样则下一个,因为会出现重复
                if i>begin and nums[i-1]==nums[i]:
                    continue
                path.append(nums[i])
                backtrack(i+1,path)
                path.pop()

        size = len(nums)
        if size == 0:
            return [[]]
        nums.sort()
        path = []
        res = []
        backtrack(0,path)
        return res