Permutation Sequence 序列排序

1. 康拓展开和康拓逆展开的应用

#include
#include
using namespace std;
int factorial(int n)
{
if (n == 1)
{
return 1;
}
return n*factorial(n - 1);
}
int getNum(int *flag,int length, int key)
{
int num = 0;
for (int i = length - 1; i > 0; i–)
{
num = 0;
for (int j = i - 1; j > 0; j–)
{
if (flag[j] == 0)
{
num++;
}
}
if (num == key)
{
return i;
}
}
return -1;
}
string PermutationSequence(int n, int k)
{
k = k - 1;
int *flag = new int[n + 1];
for (int i = 1; i < n + 1; i++)
{
flag[i] = 0;
}
string str1 = “”;
for (int i = n - 1; i > 0; i–)
{
int num = factorial(i);
int left = k / num;
int remind = k%num;
int temp = getNum(flag, n+1, left);
if (temp != -1)
{
str1.push_back(temp + ‘0’);
}
flag[temp] = 1;
k = remind;
}
int i = 1;
for (; i < n + 1; i++)
{
if (flag[i] == 0)
{
break;
}
}
str1.push_back(i + ‘0’);
return str1;
}
int main()
{
string str1 = “”;
str1.push_back(1+‘0’);
cout << PermutationSequence(3,3) << endl;
system(“pause”);
return 0;
}
自己努力去解决算法的问题，每解决一个算法的题目的时候，一定要看一下别人的解法和思路，往往有醍醐灌顶之感。