一个非dfs的娱乐写法之(雾)next_permutation
#include<bits/stdc++.h>
using namespace std;
const int N = 10;
int a[N];
int main()
{
int n;
cin >> n;
for (int i=1;i<=n;i++)
{
a[i]=i;
}
do
{
for (int i=1;i<=n;i++)
{
cout <<a[i]<<' ';
}
cout <<endl;
}while (next_permutation(a+1,a+n+1)); //下标从1开始 ,有n个数随意全排列
}