前言:为了后续的实习面试,开始疯狂刷题,非常欢迎志同道合的朋友一起交流。因为时间比较紧张,目前的规划是先过一遍,写出能想到的最优算法,第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN,mcf171专栏。
博客链接:mcf171的博客
——————————————————————————————
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.
我这个思路有点像递归的方式,比如说n=4,k=3。因为n=2的时候最多有2中排列,n=3的时候最多有6中排列,所以可以先把1加到字符串,然后算2,3,4取k=3是多少。 Your runtime beats 23.56% of java submissions.public class Solution {
public String getPermutation(int n, int k) {
List<Integer> stores = new ArrayList<Integer>();
int[] permutationNumber = new int[10];
permutationNumber[0] = 1;
for(int i = 1 ; i <= n; i ++)stores.add(i);
for(int i = 1; i < 10; i ++) permutationNumber[i] = i * permutationNumber[i-1];
StringBuffer sb = new StringBuffer("");
while(true){
if( k == 1){
for(int item : stores)sb.append(item);
break;
}
else{
int i = 9;
for(; i >= 1; i--)if(k>=permutationNumber[i])break;
int times = stores.size() - i - 1;
while (times > 0) {
sb.append(stores.get(0));
stores.remove(0);
times--;
}
if( k % permutationNumber[i] == 0){
if(i != n) {
int index = k / permutationNumber[i] - 1;
sb.append(stores.get(index));
stores.remove(index);
}
Collections.reverse(stores);
for(int item : stores) sb.append(item);
break;
}else{
int index = k / permutationNumber[i];
sb.append(stores.get(index));
stores.remove(index);
k = k % permutationNumber[i];
}
}
}
return sb.toString();
}
}