给定一个值n,输出1到n的全排列,递归进行,首先输出第一个元素(n种选法),之后递归输出除第一个元素之外的n-1个元素即可,每次要判断当前待添加的元素是否在之前已经添加过了,如果没有添加,则添加之后递归进行上述过程,具体实现见如下代码:
#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
using namespace std;
int n;
void Print(vector<int>& data,int cur){
if (cur == n){
for (int i = 0; i < n; i++){
cout << data[i] << " ";
}
cout << endl;
return;
}
else{
for (int elem = 1; elem <= n; elem++){
bool can_use = true;
for (int j = 0; j < cur; j++){
if (elem == data[j]){
can_use = false;
break;
}
}
if (can_use){
data[cur] = elem;
Print(data, cur + 1);
}
}
}
}
int main(){
while (cin >> n){
vector<int> data(n);
Print(data, 0);
}
return 0;
}