# LeetCode39:Combination Sum

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]

runtime:28ms

class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<vector<int>> result;
vector<int> path;
sort(candidates.begin(),candidates.end());
helper(candidates,0,0,target,path,result);
return result;
}

void helper(vector<int> &nums,int pos,int base,int target,vector<int>& path,vector<vector<int>> & result)
{
if(base==target)
{
result.push_back(path);
return ;
}
if(base>target)
return ;
for(int i=pos;i<nums.size();i++)
{
path.push_back(nums[i]);
helper(nums,i,base+nums[i],target,path,result);
path.pop_back();
}
}
};
• 本文已收录于以下专栏：
• LeetCode

举报原因： 您举报文章：LeetCode39:Combination Sum 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)