【LeetCode】 60. Permutation Sequence 第k个排列（Medium）（JAVA）

【LeetCode】 60. Permutation Sequence 第k个排列（Medium）（JAVA）

题目地址: https://leetcode.com/problems/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 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.
Given k will be between 1 and n! inclusive.
Example 1:

Input: n = 3, k = 3
Output: "213"

Example 2:

Input: n = 4, k = 9
Output: "2314"

题目大意

给出集合 [1,2,3,…,n]，其所有元素共有 n! 种排列。

解题方法

从 1 开始的第 k 种排列，就是从 0 开始的第 k - 1 种

其实只要计算出第 n 个元素即可
1、k / (n - 1) ！就可以算出第 n 个元素
2、不断循环计算出每个元素

class Solution {
    public String getPermutation(int n, int k) {
        if (n == 1 && k == 1) return "1";
        List<Integer> list = new ArrayList<>();
        int product = 1;
        for (int i = 1; i <= n; i++) {
            list.add(i);
            if (i != n) product *= i;
        }
        k--;
        StringBuilder res = new StringBuilder();

        while (list.size() > 0) {
            int cur = k / product;
            res.append(list.remove(cur));
            k = k % product;
            product /= Math.max(1, list.size());
        }

        return res.toString();
    }
}

执行用时 : 2 ms, 在所有 Java 提交中击败了 81.25% 的用户
内存消耗 : 37.6 MB, 在所有 Java 提交中击败了 5.78% 的用户