题目描述:
给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: nums = [1,2,3]
输出:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/subsets
思路:排列组合
代码:
import itertools
class Solution:
def __init__(self,nums):
self.result=self.subsets(nums)
def subsets(self,nums):
result=[]
for i in range(len(nums)+1):
A = list(itertools.combinations(nums,i))
for j in A:
result.append(list(j))
return result
if __name__=='__main__':
nums = [1,2,3]
solution=Solution(nums)
Lst=solution.result
print(Lst)
运行结果:
[[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]