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和k,返回在n的数的所有组合中第k个数的组合方式,字符串形式返回;
又是排列组合的题,这些题已经困扰了我很久了,找时间对算法技巧做一下总结,这道题我完成的还不错O(N)的运行时间O(1)的空间复杂度(不开辟额外空间,我还没学空间复杂度)
先贴代码:
public String getPermutation(int n, int k) {
List<Integer> list = new LinkedList<>();
for(int i = 1;i <= n;i ++)
list.add(i);
int i = 0;
k --;//因为第一个数不做变换
n --;//对于n = 1来讲只有一个组合
while(k != 0){
int num1 = k / factorial(n);//高位脚标
list.add(i,list.remove(num1 + i));
k = k % factorial(n);
n--;
i ++;
}
StringBuilder result = new StringBuilder();
for(Integer it : list){
result.append(it);
}
return result.toString();
}
public int factorial(int n){
int result = 1;
for(int i = 1;i <= n;i ++)
result *= i;
return result;
}
因为我分析要用到很多的删除添加步骤,所以我建了一个链表来存储n个数据
思路:要清楚第k个数是在哪一个最高位覆盖范围之内,比如n = 3,k = 4则k是在2高位覆盖范围内然后依次类推求出每一位的变换情况。注意k和n的变化即可。