给定一个可能包含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: [1,2,2] 输出: [ [2], [1], [1,2,2], [2,2], [1,2], [] ]
class Solution:
def dfs(self, res, val, num, start):
if val not in res:
res.append(val)
for i in range(start, len(num)):
self.dfs(res, val+[num[i]], num, i+1)
def subsetsWithDup(self, S):
res = []
if len(S) == 0:
return res
S.sort()
val = []
self.dfs(res, val, S, 0)
return res
class Solution:
def subsetsWithDup(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
res = []
def gen(index, path):
res.append(path[:])
if index > len(nums):
return
for i in range(index, len(nums)):
if i > index and nums[i] == nums[i - 1]:
continue
gen(i + 1, path + [nums[i]])
gen(0, [])
return res