40. Combination Sum II

题目描述：

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]
]

我的思路：

        跟上一道题思路类似，只不过是元素不能重复利用，大体思路不变，注意到对比重复利用的第一个元素无法加入到path里面去，所以在0位置添加了一个0，这样能保证加和不变的情况下，能够利用后面每一个元素，输出下结果因为零的加入会导致输出重复的结果，最后去重就好了。

我的代码：

def combinationSum2(self, candidates, target):
        """
        :type candidates: List[int]
        :type target: int
        :rtype: List[List[int]]
        """
        res = []
        candidates.sort()
        candidates.insert(0, 0)

        self.dfs(candidates, target, 0, [], res)
        temp_list = []
        for one in res:
            if one not in temp_list:
                temp_list.append(one)
        return temp_list


    def dfs(self, nums, target, index, path, res):
        if target < 0:
            return
        if target == 0:
            res.append(path)
            return
        for i in range(index + 1, len(nums)):
            self.dfs(nums, target - nums[i], i, path + [nums[i]], res)