全排列(Full Permutation)
全排列指的是n个整数的所有排列,按从小到大的顺序输出n个整数的全排列,其中(
a1,a2,....an
a
1
,
a
2
,
.
.
.
.
a
n
)的顺序小于(
b1,b2....bn
b
1
,
b
2
.
.
.
.
b
n
):
a1=b1,a2=b2....an=bn,ai<bi
a
1
=
b
1
,
a
2
=
b
2
.
.
.
.
a
n
=
b
n
,
a
i
<
b
i
举个例子:(1 - 3)的从小到大的顺序全排列:
(1,2,3),(1,3,2)(2,1,3),(2,3,1)(3,1,2),(3,2,1)
从分治的角度考虑,可以划分为多个子问题,"1开头的全排列","2开头的全排列"...
P[ ] 存放当前排列
hashtable[x]:当x在当前的排列P中时,hashtable[x] = true;
#include <iostream>
using namespace std;
const int maxn = 4;
int n, P[maxn], hashTable[maxn] = {false};
void generateP(int index) {
if (index == n+1) {
for (int i = 1; i <= n; i++) {
cout<<P[i];
}
cout<<endl;
}
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;
}