【LeetCode】60.Permutation Sequence(medium)解题报告

【LeetCode】60.Permutation Sequence(medium)解题报告

题目地址：https://leetcode.com/problems/permutation-sequence/description/
题目描述：

  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.

  当然可以把所有情况都求出来存储起来，然后再取第k个，但是这样时间复杂度会变高。这样我们要直接求第k个。

分析：

  比如k=17，n=4.
  i=4 index = 17/6=2 k=17%6=5
  i=3 index = 5/2=2 k=5%2=1
  i=2 index = 1/1=1 k=1%1=0

Solution:

//time:O(n)
//space:O(n)
class Solution {
    public String getPermutation(int n, int k) {
        List<Integer> res = new ArrayList<>();
        for(int i=1;i<=n;i++){
            res.add(i);
        }
        int[] fact = new int[n];
        fact[0] = 1;
        for(int i=1;i<n;i++){
            fact[i] =i * fact[i-1];
        }
        k = k-1; //0到k-1一共k个
        StringBuilder sb = new StringBuilder();
        for(int i=n ; i>0 ; i--){
            int index = k / fact[i-1];
            k = k % fact[i-1];
            sb.append(res.get(index));
            res.remove(index);
        }
        return sb.toString();
    } 
}

Date：2018年1月14日