【leetcode刷题】39 & 40 combination sum i & ii (Python)

原题链接
https://leetcode.com/problems/combination-sum
https://leetcode.com/problems/combination-sum-ii
解题思路
39
采用dfs的方法，设置target与当前遍历到的数作对比，每经过一个节点，target变为target-当前节点值。当target > 当前节点值时，继续往深处搜索；相等时，记录一组输出结果，并往上回退一级；小于时，直接往上回退一级。
值得注意的是，先把数列排一下序可以提高效率
40 与39类似，不过在遍历下一级节点时，start的索引从i+1开始，在append进结果是，要判断一下ans中是否已经有这一组结果了。
代码
39 代码

class Solution(object):
    def combinationSum(self, candidates, target):
        candidates.sort()
        self.ans = []
        self.result = []
        self.index = []
        self.DFS(candidates, target, 0)
        return self.ans


    def DFS(self, candidates, target, start):
        if target == 0:
            self.ans.append(self.result[:])
            return
        else:
            for i in range(start, len(candidates)):
                self.result.append(candidates[i])
                if target < candidates[i]:
                    self.result.pop()
                    return
                else:
                    # self.result.append(candidates[i])
                    target = target - candidates[i]
                    self.DFS(candidates, target, i)
                    self.result.pop()
                    target += candidates[i]

https://www.cnblogs.com/zuoyuan/p/3777540.html
40 代码

class Solution(object):
    def combinationSum2(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        self.ans = []
        candidates.sort()
        self.DFS(candidates, target, 0, [])
        return self.ans


    def DFS(self, candidates, target, start, valList):
        if 0 == target:
            # valList.append(candidates[start])
            if valList not in self.ans:
                self.ans.append(valList)
            return
        for i in range(start, len(candidates)):
            if candidates[i] > target:
                return
            else:
                self.DFS(candidates, target-candidates[i], i+1, valList + [candidates[i]])