The set [1,2,3,…,n]
contains a total of n! unique permutations.
By listing and labeling all of the permutations in order,
We get the following sequence (ie, for n = 3):
"123"
"132"
"213"
"231"
"312"
"321"
Given n and k, return the kth permutation sequence.
Note: Given n will be between 1 and 9 inclusive.
参考链接:http://blog.csdn.net/doc_sgl/article/details/12840715,http://blog.csdn.net/havenoidea/article/details/12837441
思路:
在n!个排列中,第一位的元素总是(n-1)!一组出现的,也就说如果p = k / (n-1)!,那么排列的最开始一个元素一定是nums[p]。
假设有n个元素,第K个permutation是
a1, a2, a3, ..... ..., an
那么a1是哪一个数字呢?
那么这里,我们把a1去掉,那么剩下的permutation为
a2, a3, .... .... an, 共计n-1个元素。 n-1个元素共有(n-1)!组排列,那么这里就可以知道
设变量K1 = K
a1 = K1 / (n-1)!
同理,a2的值可以推导为
a2 = K2 / (n-2)!
K2 = K1 % (n-1)!
.......
a(n-1) = K(n-1) / 1!
K(n-1) = K(n-2) /2!
an = K(n-1)
代码:
class Solution {
private:
vector<vector<int> >res;
vector<bool> flag;
public:
string getPermutation(int n, int k) {
int i,j,data[10],sign[10];
data[1]=1;
for(i=2;i<=n;i++) data[i]=data[i-1]*i;
memset(sign,0,sizeof(sign));
string s="";
i-=2;
k--;
while(i>=0){
int temp=k/data[i];
for(j=1;j<10;j++){
if(sign[j]==0) temp--;
if(temp<0) break;
}
sign[j]=1;
s+=j+'0';
k%=data[i];
i--;
}
return s;
}
};