Given a collection of candidate numbers (
C) and a target number (
T), find all unique combinations in
C where the candidate numbers sums to
T.
Each number in C may only be used once in the combination.
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 10,1,2,7,6,1,5
and target 8
,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
先排序,再深搜,深搜过程中防止出现重复组合。
class Solution {
public:
vector<vector<int> > res;
vector<int> com;
void combineSum(vector<int> &nums, int start, int target)
{
if (target==0)
{
res.push_back(com);
return;
}
if(target<0 || start>=nums.size())
return;
com.push_back(nums[start]);
combineSum(nums,start+1,target-nums[start]);
com.pop_back();
while(start+1<nums.size() && nums[start+1]==nums[start])
start++;
combineSum(nums,start+1,target);
}
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
res.clear();
com.clear();
sort(num.begin(),num.end());
combineSum(num,0,target);
return res;
} };