按照字典序枚举排列

打印所有的排列

/*
* 打印n的全排列！
*/

#include <iostream>
#include <cstring>
using namespace std;

#define MAX 200

void print_permutation(int, bool *, int *, int);

int main()
{
int n;
bool isPrint[MAX];
int v[MAX];
memset(isPrint, 0, sizeof(isPrint));
memset(v, 0, sizeof(v));
cin >> n;
print_permutation(0, isPrint, v, n);

return 0;
}

void print_permutation(int num, bool *isPrint, int *v, int n)
{
if (num == n)
{
for (int i = 0; i < n; ++ i)
{
cout << v[i] << " ";
}
cout << endl;
return ;
}

else
{
for (int i = 0; i < n; ++ i)
{
if ( !isPrint[i] )
{
isPrint[i] = 1;
v[num] = i + 1;
// 打印第num+1个数
print_permutation(num + 1, isPrint, v, n);
isPrint[i] = 0;
}
}
}
}

/*
* 打印可重复的n排列！
*/

#include <iostream>
#include <cstring>
using namespace std;

#define MAX 200

void print_permutation(int, int *, int);

int main()
{
int n;
int v[MAX];
memset(v, 0, sizeof(v));
cin >> n;
print_permutation(0, v, n);

return 0;
}

void print_permutation(int num, int *v, int n)
{
if (num == n)
{
for (int i = 0; i < n; ++ i)
{
cout << v[i] << " ";
}
cout << endl;
return ;
}

else
{
for (int i = 0; i < n; ++ i)
{
v[num] = i + 1;
// 打印第num+1个数
print_permutation(num + 1, v, n);
}
}
}