class Solution:
def subsetsWithDup(self,nums:list[int]) -> list[list[int]]:
nums.sort()
def dfs(index,nums,path,res):
res.append(path[:])
for i in range(index,len(nums)):
if i > index and nums[i] == nums[i-1]:
continue
path.append(nums[i])
dfs(i+1,nums,path,res)
path.pop()
res,path = [],[]
dfs(0,nums,path,res)
return res
手撕13_回溯_子集II
于 2024-04-15 01:15:23 首次发布