给定一个可能包含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: [1,2,2]
输出:
[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]
class Solution:
def subsetsWithDup(self, nums: 'List[int]') -> 'List[List[int]]':
nums.sort()
res = [[]]
for i in nums:
cr = []
for j in res:
if j + [i] not in res:
cr += [j + [i]]
res += cr
return res
DFS:
class Solution:
def subsetsWithDup(self, nums: 'List[int]') -> 'List[List[int]]':
nums.sort()
res = []
self.dfs(nums,0,[],res)
return res
def dfs(self,nums,k,path,res):
res.append(path)
for i in range(k,len(nums)):
if i > k and nums[i] == nums[i-1]:continue
self.dfs(nums,i+1,path+[nums[i]],res)
相关题目: