40. Combination Sum II(Python3)

40. Combination Sum II(Python3)

题目

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Each number in C may only be used once in the combination.

Note:

• All numbers (including target) will be positive integers.
• The solution set must not contain duplicate combinations.

For example, given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8,
A solution set is:

[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

解题方案

思路：

• 典型的DFS，使用递归效果最佳，为了减少遍历，需要将候选元素排序，要注意使用过的元素不可以再次使用，同时重复出现的元素可能会有重复的结果出现，为了避免出现，下面的一段代码很重要

if i!=index and cand[i] == cand[i-1]:
    continue

• 该代码保证了元素不重复同时又不是本次递归出现的，其中深奥请多家领会

代码：

class Solution:
    def combinationSum2(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """

        def dfs(cand,res,index,target,path):
            if target == 0:
                res.append(path)
                return 
            if target < 0:
                return
            for i in range(index,len(cand)):
                if i!=index and cand[i] == cand[i-1]:
                    continue
                dfs(cand,res,i+1,target-cand[i],path+[cand[i]])
        res = []
        candidates.sort()
        dfs(candidates,res,0,target,[])
        return res