-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCombinationSumII.cc
More file actions
43 lines (39 loc) · 1.1 KB
/
Copy pathCombinationSumII.cc
File metadata and controls
43 lines (39 loc) · 1.1 KB
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
33
34
35
36
37
38
39
40
41
42
43
#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
#include <sstream>
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<vector<int> > combinationSum2(vector<int>& num, int target) {
vector<vector<int> > result;
vector<int> solution;
int sum = 0;
std::sort(num.begin(), num.end());
GetCombinations(num, sum, 0, target, solution, result);
return result;
}
void GetCombinations(vector<int>& candidates, int& sum, int level, int target,
vector<int>& solution, vector<vector<int> >& result) {
if (sum > target) return;
if (sum == target) {
result.push_back(solution);
return;
}
for (int i = level; i < candidates.size(); i++) {
sum += candidates[i];
solution.push_back(candidates[i]);
GetCombinations(candidates, sum, i + 1, target, solution, result);
solution.pop_back();
sum -= candidates[i];
while (i < candidates.size() - 1 && candidates[i] == candidates[i + 1])
i++;
}
}
};
int main(int argc, char const* argv[]) {
/* code */
return 0;
}