题目
给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
链接:https://leetcode.com/problems/subsets-ii/
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.
Example:
Input: [1,2,2]
Output:
[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]
思路及代码
1. DFS
- 同39,40,78题
class Solution:
def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
cur = []
ans = [[]]
nums = sorted(nums)
def dfs(start, cur, ans):
for i in range(start, len(nums)):
cur.append(nums[i])
if cur not in ans:
ans.append(cur.copy())
dfs(i+1, cur, ans)
cur.pop()
dfs(0, cur, ans)
return ans
2.
- 在同样深度相同的数字只能用一次
class Solution:
def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
cur = []
ans = [[]]
nums = sorted(nums)
def dfs(start, cur, ans):
for i in range(start, len(nums)):
if i > start and nums[i] == nums[i-1]:
continue
cur.append(nums[i])
ans.append(cur.copy())
dfs(i+1, cur, ans)
cur.pop()
dfs(0, cur, ans)
return ans
复杂度
T =
O
(
n
∗
2
n
)
O(n*2^n)
O(n∗2n)
S =
O
(
n
)
O(n)
O(n)