2019-05-31LeetCode216. 组合总和 III
2019-05-31 本文已影响0人
mztkenan
20min 错误在于分支搞不清
def combinationSum3(self, k: int, n: int) -> List[List[int]]:
res=[]
self.dfs(1,[],res,k,n)
return res
def dfs(self,start,path,res,k,n):
if len(path)==k:
if n==0:res.append(path+[])
return
for i in range(start,10): #错在i与start分不清
path.append(i)
self.dfs(i+1, path, res, k, n - i)
path.pop()
