【Leetcode】040Combination Sum

---

问题描述

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
Each number in candidates may only be used once in the combination.
和前边的那题类似，但是要求最后的结果中没有重复

---

例子

Input: candidates = [10,1,2,7,6,1,5], target = 8,
A solution set is:
[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]

Input: candidates = [2,5,2,1,2], target = 5,
A solution set is:
[
[1,2,2],
[5]
]

---

2019-06-13

拿上一题的代码运行一次，出现的结果中有[1,1,1,1,1,1,1,1]，八个一，但是给的候选列表中并没有这么多；另外在不同的循环中会产生相同的结果。第一点要求深度遍历时，不再考虑已经遍历过的元素，也就是在遍历过程中需要将当前的层的起始位置传递。第二点要求判断新产生的tmp=tmp+candadates[i]是否存在于返回列表中。

class Solution(object):
    def combinationSum2(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        def DFS(candidates,target,i,tmp):
            if target==0 and tmp not in res:#[[1, 1, 6], [1, 2, 5], [1, 7], [2, 6]]`这里的not in 是为了确保不会因为不同的循环中产生相同的结果导致最后答案错误`
                #print(tmp)
                res.append(tmp)
                return res
            for i in range(i,len(candidates)):
                if target >=candidates[i]:
                    DFS(candidates,target-candidates[i],i+1,tmp+[candidates[i]])
                    #[[1, 1, 6], [1, 2, 5], [1, 7], [1, 2, 5], [1, 7], [2, 6]]
                else:
                    break

        res = []
        candidates.sort()
        DFS(candidates,target,0,[])
        #print(res)
        return res
S = Solution()
# candidates = [2,5,2,1,2]
candidates = [10,1,2,7,6,1,5]
target = 8
S.combinationSum2(candidates,target)

---

结果分析

Runtime: 56 ms, faster than 70.66% of Python online submissions for Combination Sum II.
Memory Usage: 11.9 MB, less than 25.87% of Python online submissions for Combination Sum II.