{leetcode}/problems/combination-sum/[LeetCode - Combination Sum^]
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]
]
参考 46. Permutations 认真学习一下回溯思想。
为了避免重复,每次只遍历不比自己小的元素。(比自己小的元素已经被小元素遍历过了。)
- 一刷
-
link:{sourcedir}/_0039_CombinationSum.java[role=include]
- 二刷
-
link:{sourcedir}/_0039_CombinationSum_2.java[role=include]
- 三刷
-
link:{sourcedir}/_0039_CombinationSum_3.java[role=include]