dfs(int u):搜索第u个位置上可以放哪个数字
#include <iostream>
#include <vector>
using namespace std;
const int N = 10;
int n;
bool st[N];
int path[N];
void dfs(int u)
{
if (u == n)
{
for (int i = 0; i < n; ++ i) cout << path[i] << " ";
cout << endl;
return ;
}
for (int i = 1; i <= n; ++ i)
{
if (!st[i])
{
path[u] = i;
st[i] = true;
dfs(u + 1);
path[u] = 0; // 也可以不写这行,因为path[u]会被不断地替换掉
st[i] = false;
}
}
}
int main()
{
cin >> n;
dfs(0);
return 0;
}