题目描述:
方法一:
class Solution: def combinationSum(self, candidates, target): """ :type candidates: List[int] :type target: int :rtype: List[List[int]] """ ans=[] n=len(candidates) if candidates==[]: return [] for i in range(n): if candidates[i]==target: ans.append([candidates[i]]) elif candidates[i]<target: l=self.combinationSum(candidates[i:],target-candidates[i]) for x in l: x.append(candidates[i]) ans+=l return ans