#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> result; //存放所有符合条件的路径的结果集合result
vector<int> path; //存放符合条件的路径path
void backtrack(int n, int k, int startIndex)
{
if (path.size() == k)
{
result.push_back(path);
return;
}
//控制树的横向遍历
for (int i = startIndex; i <= n; ++i)
{
path.push_back(i);
backtrack(n, k, i + 1); //递归:控制树的纵向遍历
path.pop_back();
}
}
vector<vector<int>> combine(int n, int k)
{
backtrack(n, k, 1);
return result;
}
int main(){
vector<vector<int>> a;
int n,m;
cin>>n>>m;
a=combine(n,m);
for(int i = 0; i < a.size() ;++i){
for(int j = 0 ;j< a[0].size();++j){
cout << a[i][j] << " ";
}
cout << endl ;
}
}
input:n,m
couput: 的所有结果
参考资料: