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
| class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<vector<int>> ret;
vector<int> temp;
backTrack(ret, candidates, temp, target, 0);
return ret;
}
private:
void backTrack(vector<vector<int>>& ret, vector<int>& candidates, vector<int>& temp, int remain, int start)
{
if(remain < 0)
return;
if(remain == 0)
{
ret.push_back(temp);
return;
}
for(size_t i = start; i < candidates.size(); ++i)
{
temp.push_back(candidates[i]);
backTrack(ret, candidates, temp, remain - candidates[i], i);
temp.pop_back();
}
}
};
|