LeetCode-78-Subsets 水题暴力
2017-09-27 14:42
465 查看
class Solution(object):
ans=[]
cur=[]
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
self.ans=[]
self.ans.append([])
self.cur=[]
self.dfs(nums)
return self.ans
def dfs(self,nums):
Len=len(nums)
if self.cur!=[]:self.ans.append(self.cur[:])
for i in range(Len):
self.cur.append(nums[i])
self.dfs(nums[i+1:])
self.cur.pop()
ans=[]
cur=[]
def subsets(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
self.ans=[]
self.ans.append([])
self.cur=[]
self.dfs(nums)
return self.ans
def dfs(self,nums):
Len=len(nums)
if self.cur!=[]:self.ans.append(self.cur[:])
for i in range(Len):
self.cur.append(nums[i])
self.dfs(nums[i+1:])
self.cur.pop()
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode] 78. Subsets
- [leetcode] 78. Subsets
- [LeetCode] 78. Subsets
- leetcode_middle_58_78. Subsets
- leetcode-78-Subsets
- Leetcode 78. Subsets
- 【leetcode】【78】Subsets
- leetcode[78] Subsets
- LeetCode 之 Subsets（图和暴力枚举）
- [leetcode]78. Subsets
- 【leetcode】Array——Subsets（78）
- Leetcode 78. Subsets
- [LeetCode 78] Subsets
- Leetcode 78. Subsets
- 递归-数组的子集：leetcode 78 Subsets
- [leetcode] 78.Subsets
- [leetcode]#78 Subsets
- leetcode_78——Subsets（基于DFS的递归，基于同质的递推）
- [leetcode 78] Subsets
- LeetCode_78 Subsets