-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathCombination Sum.cpp
32 lines (28 loc) · 932 Bytes
/
Combination Sum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
int sum=0;
vector<int> solution;
vector<vector<int>> result;
sort(candidates.begin(),candidates.end());
getcombinationSum(sum,0,target,candidates,solution,result);
return result;
}
void getcombinationSum(int &sum,int level,int target,vector<int>&candidates,vector<int>&solution,vector<vector<int>> &result){
if(sum==target)
{
result.push_back(solution);
return;
}
if(sum>target)
return;
for(int i=level;i<candidates.size();i++)
{
sum+=candidates[i];
solution.push_back(candidates[i]);
getcombinationSum(sum,i,target,candidates,solution,result);
solution.pop_back();
sum-=candidates[i];
}
}
};