s******b
发帖数: 185 | 1 https://leetcode.com/problems/combination-sum/description/
半路出家的遇到这种题目就搞不定时间空间复杂度分析了。
我的code:
class Solution(object):
def combinationSum(self, candidates, target):
if not candidates:
return []
res=[]
self.dfs(res,candidates,target,[])
return res
def dfs(self,res,candidates,target,curr):
if sum(curr)==target:
res.append(curr)
return
if sum(curr)>target:
return
for i in range(len(candidates)):
self.dfs(res,candidates[i:],target,curr+[candidates[i]]) |
