【LeetCode】#60第k个排列(Permutation Sequence)

【LeetCode】#60第k个排列(Permutation Sequence)

题目描述

给出集合 [1,2,3,…,n]，其所有元素共有 n! 种排列。
按大小顺序列出所有排列情况，并一一标记，当 n = 3 时, 所有排列如下：
“123”
“132”
“213”
“231”
“312”
“321”
给定 n 和 k，返回第 k 个排列。
说明：
给定 n 的范围是 [1, 9]。
给定 k 的范围是[1, n!]。

示例

示例 1:

输入: n = 3, k = 3
输出: “213”

示例 2:

输入: n = 4, k = 9
输出: “2314”

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 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.
Given k will be between 1 and n! inclusive.

Example

Example 1:

Input: n = 3, k = 3
Output: “213”

Example 2:

Input: n = 4, k = 9
Output: “2314”

解法

class Solution {
    public String getPermutation(int n, int k) {
        StringBuilder res = new StringBuilder();
        int num = k;
        StringBuilder sb = new StringBuilder();
        int factorial = calFactorial(n);
        for(int i=1; i<=n; i++){
            sb.append(i);
        }
        for(int i=n; i>=1; i--){
            factorial /= i;
            int index = (num-1)/factorial;
            String tmp = ""+sb.charAt(index);
            res.append(tmp);
            num -= index*factorial;
            sb = sb.deleteCharAt(index);
        }
        return res.toString();
    }
    public int calFactorial(int n){
        int ans = 1;
        for(int i=1; i<=n; i++){
            ans *= i;
        }
        return ans;
    }
}