-
Notifications
You must be signed in to change notification settings - Fork 0
/
CombinationSumIII.cpp
58 lines (43 loc) · 1.01 KB
/
CombinationSumIII.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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/*
Find all possible combinations of k numbers that add up to a number n,
given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
Example 1:
Input: k = 3, n = 7
Output:
[[1,2,4]]
Example 2:
Input: k = 3, n = 9
Output:
[[1,2,6], [1,3,5], [2,3,4]]
*/
#include <iostream>
#include <vector>
using namespace std;
void res(int k, int n, int level, vector<int> &temp, vector<vector<int> > &result) {
cout << "[";
for (auto t : temp)
cout << t << " ";
cout << "]" << endl;
if (n < 0) return;
if (n == 0 && temp.size() == k) result.push_back(temp);
for (int i = level; i <= 9; ++i) {
temp.push_back(i);
res(k, n - i, i + 1, temp, result);
temp.pop_back();
}
}
vector<vector<int> > combinationSum3(int k, int n) {
vector<vector<int> > result;
vector<int> temp;
res(k, n, 1, temp, result);
return result;
}
int main() {
vector<vector<int>> a = combinationSum3(3, 9);
for(auto e : a){
cout << "[";
for (auto t : e)
cout << t << " ";
cout << "]" << endl;
}
}