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.
Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:
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]
]
func combinationSum2(candidates []int, target int) [][]int {
res := &[][]int{}
sort.Ints(candidates)
dfs(candidates, target, 0, []int{}, res)
return *res
}
func dfs(graph []int, target int, index int, path []int, ans *[][]int) {
if target == 0 {
tmp := make([]int, len(path))
copy(tmp, path)
*ans = append(*ans, tmp)
return
}
for i := index; i < len(graph); i++ {
if graph[i] > target {
break
}
if i > index && graph[i] == graph[i-1] {
continue
}
dfs(graph, target-graph[i], i+1, append(path, graph[i]), ans)
}
}
