leetcode.array--78. Subsets
2017-10-28 22:44
423 查看
题目:78. Subsets
题目链接:https://leetcode.com/problems/subsets/description/
给定数组,求其所有的子集。其实就是找到n=0,1,2...len(nums)时候的组合嘛。Python有的内建模块tertools,里面有排列组合函数,分别是combinations和permutations。Python3中两个函数均返回一个生成器。
Python:
import itertools
class Solution(object):
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res=[]
for i in range(len(nums)+1):
for item in (map(list, itertools.combinations(nums, i))):
res+=[item]
return res
题目链接:https://leetcode.com/problems/subsets/description/
给定数组,求其所有的子集。其实就是找到n=0,1,2...len(nums)时候的组合嘛。Python有的内建模块tertools,里面有排列组合函数,分别是combinations和permutations。Python3中两个函数均返回一个生成器。
Python:
import itertools
class Solution(object):
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res=[]
for i in range(len(nums)+1):
for item in (map(list, itertools.combinations(nums, i))):
res+=[item]
return res
相关文章推荐
- 【leetcode】Array——Subsets(78)
- Leetcode 78 Subsets
- [leetcode] 78. Subsets
- [leetcode 78 & 90, Medium] Subsets I and II
- leetcode(78). Subsets
- LeetCode(78) Subsets
- Leetcode 78 Subsets
- 【LeetCode】C# 78、Subsets
- [leetcode-78]subsets(java)
- [leetcode 78] Subsets
- LeetCode78——Subsets
- leetcode 78 :Subsets
- LeetCode 78. Subsets
- leetcode_middle_58_78. Subsets
- leetcode[78] Subsets
- LeetCode-78-Subsets(回溯法)-Medium
- leetcode_78——Subsets(基于DFS的递归,基于同质的递推)
- <LeetCode OJ> 78. Subsets
- [LeetCode 78] Subsets
- [LeetCode] Subsets I (78) & II (90) 解题思路,即全组合算法