数字组合sum 可以重复的

最新推荐文章于 2022-03-14 16:52:14 发布

江上渔者21号

最新推荐文章于 2022-03-14 16:52:14 发布

阅读量253

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010325193/article/details/80399874

版权

leetcode 专栏收录该内容

175 篇文章 3 订阅

订阅专栏

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

Example 1:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
  [7],
  [2,2,3]
]

Example 2:

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
  [2,2,2,2],
  [2,3,3],
  [3,5]
]

class Solution {

public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<int> ivec;
vector<vector<int> > res;
sort(candidates.begin(),candidates.end());
dfs(candidates,0,target,ivec,res);

return res;
}

void dfs(vector<int> &candidates,int k,int target,vector<int> temp,vector<vector<int> > &res){
if(target==0){
res.push_back(temp);
}else if(target<0){
return ;
}

for(int i=k;i<candidates.size();++i){
temp.push_back(candidates[i]);
dfs(candidates,i,target-candidates[i],temp,res);
temp.pop_back();
}
}
};