forked from fanfank/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
combination-sum-ii.cpp
31 lines (31 loc) · 1.11 KB
/
combination-sum-ii.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
class Solution { //almost the same as combination-sum.cpp
public:
vector<vector<int> > vv;
void dfs(vector<int> &v, int index, const int &target, int sum, vector<int> &helper) {
if(index >= v.size() || v[index] > target)
return;
int sz = v.size();
for(int i = index; i < sz; ++i) {
if(i != index && v[i] == v[i-1])
continue;
sum += v[i];
if(sum > target)
return;
helper.push_back(v[i]);
if(sum == target)
vv.push_back(helper);
dfs(v, i + 1, target, sum, helper); //from dfs(v, i, target, sum, helper) to now
helper.pop_back();
sum -= v[i];
}
}
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
vv.clear();
vector<int> v;
sort(num.begin(), num.end());
dfs(num, 0, target, 0, v);
return vv;
}
};