60. Permutation Sequence

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):

1. "123"
2. "132"
3. "213"
4. "231"
5. "312"
6. "321"

Given n and k, return the kth permutation sequence.

Note: Given n will be between 1 and 9 inclusive.

这里可以知道n个数的排列组合是n!，n-1个数是(n-1)!。对于k来说，k／(n-1)!，能算出来一个index，对应第一个数。之后k-index*(n-1)!，继续除以(n-2)!，算出来的index对应第二个数。依此类推，可以算出所有的数。代码如下：

public class Solution {
    public String getPermutation(int n, int k) {
        List<Integer> num = new ArrayList<Integer>();
        StringBuilder sb = new StringBuilder();
        int[] count = new int[n + 1];
        count[0] = 1;
        for (int i = 1; i <= n; i ++) {
            count[i] = count[i - 1] * i;
            num.add(i);
        }
        k --; //防止最后剩个1，num越界
        for (int i = 1; i <= n; i ++) {
            int index = k / count[n - i];
            sb.append(num.get(index));
            num.remove(index);
            k -= index * count[n - i];
        }
        return sb.toString();
    }
}