从n个数中选m个,组合有哪些?只输出组合,不进行排列!
(如果想排列,博客中有针对某一个组合进行专门排列的:https://blog.csdn.net/qq_35007834/article/details/100134635)
#include <stdio.h>
#include <cstring>
#include <fstream>
#include <iostream>
using namespace std;
#include <vector>
void dfs(vector<vector<int>>&points,int pos, int cnt, int n, int k, int a[], bool visited[])
{
//已标记了k个数,输出结果
if (cnt == k)
{
vector<int> point;
for (int i = 0; i < n; i++)
{
if (visited[i])
point.push_back(a[i]);
}
points.push_back(point);
return;
}
//处理到最后一个数,直接返回
if (pos == n) return;
//如果a[pos]没有被选中
if (!visited[pos])
{
//选中a[pos]
visited[pos] = true;
//处理在子串a[pos+1, n-1]中取出k-1个数的子问题
dfs(points,pos + 1, cnt + 1, n, k, a, visited);
//回溯
visited[pos] = false;
}
//处理在子串a[pos+1, n-1]中取出k个数的问题
dfs(points,pos + 1, cnt, n, k, a, visited);
}
int main()
{
int i, n = 5, k = 3;
vector<vector<int>> points;
int *a = new int[n];
bool *visited = new bool[n];
for (i = 0; i < n; i++)
{
a[i] = i + 1;
visited[i] = false;
}
dfs(points,0, 0, n, k, a, visited);
for (int i = 0; i < points.size(); i++)
{
for (int j = 0; j < points[0].size(); j++)
cout << points[i][j] << " ";
cout << endl;
}
return 0;
}
结果如下: