Problem
# Given a collection of integers that might contain duplicates, nums,
# return all possible subsets (the power set).
#
# Note: The solution set must not contain duplicate subsets.
#
# For example,
# If nums = [1,2,2], a solution is:
#
# [
# [2],
# [1],
# [1,2,2],
# [2,2],
# [1,2],
# []
# ]
Idea
1. 由于不可重,因此需要先对x做sort(),以保证后面简单地通过“not in”即可完成去重;
2. 每次对现有子集做一份 拷贝;
3. 从x中选定一个数,后插入 该拷贝中的所有样本 尾部;
4. 拷贝集 参照原子集,进行去重;
5. 将拷贝集 并入 原子集。
AC
DFS:
class Solution():
def subsetsWithDup(self, x):
if not x:
return [[]]
else:
x.sort()
tmp = self.subsetsWithDup(x[:-1])
res = tmp + [i+[x[-1]] for i in tmp if i+[x[-1]] not in tmp]
return res
迭代:
class Solution():
def subsetsWithDup(self, x):
x.sort() # 需要先sort,因为list中就算元素相同,只要先后顺序不一样,就无法去重
res = [[]]
for i in range(len(x)):
for j in range(len(res)):
if res[j]+[x[i]] not in res: # 去重查验
res.append(res[j]+[x[i]])
return res
if __name__ == "__main__":
assert Solution().subsetsWithDup([1, 2, 2]) == [[], [1], [2], [1, 2], [2, 2], [1, 2, 2]]