Leetcode, leetcodeoj
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
Note:
-All numbers (including target) will be positive integers.
-Elements in a combination (a1, a2 ,... , Ak) must be in non-descending order. (ie, a1 ≤ a2 ≤... ≤ Ak ).
-The solution set must not contain duplicate combinations.
For example, given candidate set 2, 3, 6, 7 and target 7,
A solution set is:
[7]
[2, 2, 3]
Ideas
T = a1 + a2 +... + ak First, fix an element. Ai (1 ≤ I ≤ k) , Then the remaining elements are added equal T−ai While the remaining elements can be added recursively as follows:Vector <int> pre = combinationSum (c, target-* I). One of the purposes is to quickly reduce Target (And even Target = a1 Even Target <a1