打卡群刷题总结0826——组合总和

class Solution(object):
    def dfs(self, nums, start, target, current):
        if len(nums) == 0:
            return 
        if target == 0:
            self.res.append(current)
        else:
            for i in range(start, len(nums)):
                num = nums[i]
                if num > target:
                    break
                current2 = copy.copy(current)
                current2.append(num)
                self.dfs(nums, i, target - num, current2)
            
    
    def combinationSum(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        candidates.sort()
        self.res = []
        self.dfs(candidates, 0, target, [])
        return self.res