40. Combination Sum II
Given a set of candidate numbers (C) (without duplicates) 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]
]
Solution: DFS
class Solution(object):
def combinationSum2(self, candidates, target):
"""
:type candidates: List[int]
:type target: int
:rtype: List[List[int]]
"""
candidates.sort()
combinations = []
combination = []
def dfs(start, remain):
if remain < 0:
return
if remain == 0:
combinations.append(list(combination))
return
for idx in xrange(start, len(candidates)):
num = candidates[idx]
if idx > start and num == candidates[idx - 1]:
continue
combination.append(num)
dfs(idx + 1, remain - num)
combination.pop()
dfs(0, target)
return combinations