Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
The same repeated number may be chosen from candidates unlimited number of times.
Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:
Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]
Example 2:
Input: candidates = [2,3,5], target = 8,
A solution set is:
[
[2,2,2,2],
[2,3,3],
[3,5]
]
解题视频链接，第一想法也是DFS来做，按着DFS的代码范式来写
func combinationSum(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
}
dfs(graph, target-graph[i], index, append(path, graph[i]), ans)
index++
}
}
Golang的深浅层的复制机制需要注意
