在翻看啊哈磊大神的啊哈算法的时候看到过全排列的实现,是作为深度优先搜索算法的引例出现的,今天做题的时候又遇见要求递归实现全排列,心想为什么我要深度优先呢?我一定要写出属于自己的递归全排序!我苦思冥想!
#include <iostream>
using namespace std;
void FP(int permutation[], int book[], int step, int total)
{
if (step > total)
{
for (int i = 1; i <= total; i++)
{
cout << permutation[i];
}
cout << endl;
return;
}
else
{
for (int i = 1; i <= total; i++)
{
if (book[i] == 0)
{
permutation[step] = i;
book[i] = 1;
FP(permutation, book, step + 1, total);
book[i] = 0;
}
}
}
}
void FullPermutation(int n) //全排列
{
int* permutation = new int[n + 1];
int* book = new int[n + 1];
for (int i = 0; i <= n; i++)book[i] = 0;
FP(permutation, book, 1, n);
}
int main()
{
FullPermutation(9);
}
终于写出了和啊哈磊大神一样的代码。
但至少我还比人家多了个壳不是么
PS:狗日的PTA乙级