标签：acwing - MeowrainのBlog|木更老婆！！！

dfs--acwing排列数字

蓝桥杯算法刷题

#include <iostream>using namespace std;const int N = 10;bool st[N];int path[N];int n;void dfs(int u){ if(u == n){ for(int i = 0;i <

蓝桥杯算法刷题

#include <iostream>using namespace std;const int N = 10;int path[N];//保存序列bool state[N];//保存状态int n;void dfs(int u){ if(u>n){ //递归边界