leetcode78subset
2017-05-05 12:48
295 查看
class Solution(object):
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
res=[]
line=[]
self.helper(nums,res,line)
return res
def helper(self,nums,res,line):
res.append([x for x in line])
for i,x in enumerate(nums):
line.append(x)
self.helper(nums[i+1:],res,line)
line.pop()
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
res=[]
line=[]
self.helper(nums,res,line)
return res
def helper(self,nums,res,line):
res.append([x for x in line])
for i,x in enumerate(nums):
line.append(x)
self.helper(nums[i+1:],res,line)
line.pop()
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode78 subset
- LeetCode(78)Subset
- LeetCode78/90 subset I/II**
- [LeetCode 78] Subsets && [LeetCode 90] Subsets II
- leetcode 78: Populating Next Right Pointers in Each Node
- 78_leetcode_Binary Tree Postorder Traversal
- 递归-数组的子集：leetcode 78 Subsets
- 【leetcode78】Single Number II
- leetcode90subsetii
- Leetcode 78. Subsets
- leetcode 78. Subsets
- leetcode 368. Largest Divisible Subset
- LeetCode 39,40,46,47,78,90 回溯法专题
- LeetCode 78 Search a 2D Matrix
- leetcode之subset II
- LeetCode 2015.8.7 173,75,39,78,82,90,103
- [LeetCode]78 Subsets
- Leetcode 78. Subsets
- leetcode-78-Subsets
- [Leetcode]368. Largest Divisible Subset