Leetcode 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 k th permutation sequence.
Note: Given n will be between 1 and 9 inclusive.

题目链接

题目描述
给定n，求从1到n的全排列中第k个全排列。

1. 模拟全排列的生成过程，循环求第k个。

public String getPermutation(int n, int k) {
        int[] nums = new int[n]; 
        for ( int i=1 ; i<=n; i++ ) 
            nums[i-1] = i ; 
        int index=0;
        for ( int i=1; i<k; i++ ) {
            for ( int j=n-1; j>0; j-- ) {
                if ( nums[j]>nums[j-1] ) {
                    index = j ;
                    break; 
                }
            }

            for ( int j=n-1; j>=0; j-- ) {
                if ( nums[j]>nums[index-1] ) {
                    int temp = nums[j]; 
                    nums[j] = nums[index-1]; 
                    nums[index-1] = temp; 
                    break ; 
                }
            }
            for ( int j=index; j<=(index+n-1)/2; j++ ) {
                int temp = nums[j]; 
                nums[j] = nums[n-1-(j-index)]; 
                nums[n-1-(j-index)] = temp;
            }
        }

        StringBuilder b = new StringBuilder(""); 
        for ( int i=0; i<n; i++ ) {
            b.append(nums[i]); 
        }
        return b.toString();
    }

1. 从1到n的全排列之中，第k个全排列的每一位可以计算出来。第一个全排列是123…n,对于第i位，其随后的全排列数是(n-i)!个，当前位置的数字，就是k/(n-i)!，类比进制。

public String getPermutationM2(int n, int k) {
        k--;
        ArrayList<Integer> nums = new ArrayList<>(); 
        for ( int i=1; i<=n; i++ ) nums.add(i);
        int[] f = new int[n]; 
        f[0] = 1; 
        for ( int i=1; i<n; i++ ) f[i] = i*f[i-1];
        StringBuilder b = new StringBuilder("");
        for ( int i=1; i<=n; i++ ) {
            b.append( nums.get(k/f[n-i]) );
            nums.remove(k/f[n-i]);
            k %= f[n-i];
        }
        return b.toString();
    }

欢迎交流指正~~