-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
41 lines (36 loc) · 977 Bytes
/
main.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
#include <iostream>
#include <vector>
using namespace std;
class Solution {
vector<vector<int>> combines;
void combine(vector<int> oneCombine, int n, int number, int k) {
if (k == 1) {
for (int i = n; i <= number; i++) {
vector<int> tmp(oneCombine);
tmp.push_back(i);
combines.push_back(tmp);
}
return;
}
for (int i = n; i < number; i++) {
vector<int> tmp(oneCombine);
tmp.push_back(i);
combine(tmp, i + 1, number, k - 1);
}
}
vector<vector<int>> combine(int n, int k) {
for (int i = 1; i + k <= n + 1; i++) {
vector<int> tmp;
tmp.push_back(i);
if (k == 1) {
combines.push_back(tmp);
} else {
combine(tmp, i + 1, n, k - 1);
}
}
return this->combines;
}
};
int main() {
return 0;
}