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

"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个数字的排列总数是n！，由k可以通过除法和取余来确定序列内容，具体来讲：

参照这里：http://fisherlei.blogspot.hk/2013/04/leetcode-permutation-sequence-solution.html

假设有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)

public class Solution {
    public String getPermutation(int n, int k) {
        int[] nums = new int[n];
        //初始化候选数组
        int perNum = 1;
        for(int i=0; i<n; i++){
            nums[i] = i+1;
            perNum *= i+1;//计算n个数总共有几种排列
        }
        k--;//把数字变成下标形式
        StringBuffer sb = new StringBuffer();//记录结果
        for(int i=0; i<n; i++){
            //从高到底逐个确定每一位上的数字
            perNum = perNum/(n-i);
            int index = k/perNum;
            sb.append(nums[index]);
            for(int j=index; j<n-1; j++){
                //后面往前把挑走得位置补起来
                nums[j] = nums[j+1];
            }
            k = k%perNum;
        }
        return sb.toString();
    }
}