本题是dfs的经典题型,到达底部的时候,进行回溯并且恢复,做题的时候,画图更好理解一点
#include<iostream>
using namespace std;
const int N = 10;
int path[N];
bool flag[N];
int 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 (!flag[i]){
path[u] = i;
flag[i] = true;
dfs(u + 1);
flag[i] = false;
}
}
}
int main(){
cin >> n;
dfs(0);
return 0;
}