leetcode，leetcodeoj

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]

思路

T=a1+a2+...+ak，首先固定某一個元素ai(1≤i≤k),則剩餘元素相加等於T−ai.而剩餘元素相加可以如下遞迴vector<vector<int> > pre = combinationSum(c, target - *i)。其中的一個目的是為了快速減小target（以至target=a1甚至target<a1