Package g0001_0100.s0060_permutation_sequence

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • "123"

    • "132"

    • "213"

    • "231"

    • "312"

    • "321"

    Given n and k, return the <code>k<sup>th</sup></code> 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 &lt;= n &lt;= 9

    • 1 &lt;= k &lt;= n!

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String getPermutation(Integer n, Integer k)

      • Methods inherited from class java.lang.Object

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