# LeetCode39:Combination Sum

2105人阅读 评论(2)

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();
}
}
};
1
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：315759次
• 积分：5994
• 等级：
• 排名：第4207名
• 原创：261篇
• 转载：43篇
• 译文：13篇
• 评论：42条
友情链接
博客专栏
 设计模式（C++） 文章：24篇 阅读：16066
 LeetCode 文章：94篇 阅读：62571
 openGL系列教程 文章：13篇 阅读：26113
文章分类
评论排行
最新评论