数据结构算法操作试题(C++/Python)—— 组合总和

class Solution(object):
    def combinationSum(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        res = []
        candidates.sort()
        def dfs(remain,path):
            if not remain:
                res.append(path)
                return
            for i in candidates:
                if i>remain:
                    break
                elif path and i<path[-1]:
                    continue
                else:
                    dfs(remain-i,path+[i])
        dfs(target,[])
        return res