Package g0001_0100.s0060_permutation_sequence

Class Solution

java.lang.Object
g0001_0100.s0060_permutation_sequence.Solution
public class Solution extends java.lang.Object
60 - Permutation Sequence.

Hard

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.

Example 1:

Input: n = 3, k = 3

Output: “213”

Example 2:

Input: n = 4, k = 9

Output: “2314”

Example 3:

Input: n = 3, k = 1

Output: “123”

Constraints:

  • 1 <= n <= 9
  • 1 <= k <= n!

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    java.lang.String
    getPermutation(int n, int k)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • getPermutation

      public java.lang.String getPermutation(int n, int k)