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 <

acwing每日一题-字符串删减


参考:https://www.acwing.com/solution/content/56819/#include <iostream>#include <algorithm>#include <string>using namespace std;int num