题目分析:
这一题是给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。如:
输入: nums = [1,2,3]
输出:
[[3],[1],[2],[1,2,3],[1,3],[2,3],[1,2],[]]
解题思路:(两种解法)
一、这个题可以按照【LeetCode】77. Combinations的方法递归解决(最外层多加个for),过程及其思路请参考【LeetCode】77. Combinations
二、还有一种牛逼的方法:
- 先取空列表[]加入res,res = [[]]
- 然后把[] + nums[0]加进去,res = [[], [1]]
- 把[] + nums[1], [1] + nums[1]加进去,res = [[], [1], [2], [1, 2]]
- [] + nums[2], [1] + nums[2], [2] + nums[2], [1, 2] + nums[2],res = [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]
- 完毕,基本思路就是每次把res的值都取出来加入新元素再放进去,等于是一个双循环
测试代码(1):(Runtime: 44 ms, faster than 62.10 % )
class Solution:
def subsets(self, nums: list) -> list:
res = []
def dfs(k, start, out):
if len(out) == k:
res.append(list(out))
return
i = start
while i < len(nums):
if k - len(out) > len(nums) - i:
break
out.append(nums[i])
dfs(k, i + 1, out)
out.pop()
i += 1
for i in range(len(nums)):
dfs(i, 0, [])
res.append(nums)
return res
print(Solution().subsets(nums = [1,2,3])) #提交时请删除该行
测试代码(2):(Runtime: 40 ms, faster than 82.14 % )
class Solution:
def subsets(self, nums):
result = [[]]
for num in nums:
result += [i + [num] for i in result]
return result
print(Solution().subsets(nums = [1,2,3])) #提交时请删除该行