算法笔记–胡凡 4.3.2
#include<iostream>
using namespace std;
const int maxn = 11;
int n,P[maxn],hashTable[maxn] = {false};
void generateP(int index)
{
if(index == n + 1)
{
for(int i=1;i<=n;i++)
printf("%d",P[i]);
printf("\n");
return ;
}
for(int x = 1; x <= n; x++)
{
if(hashTable[x] == false)
{
P[index] = x;
hashTable[x] = true;
generateP(index + 1);
hashTable[x] = false;
}
}
}
int main()
{
n = 3;
generateP(1);
return 0;
return 0;
} ```