permutation-sequence

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

The set <code>[1, 2, 3, ...,&nbsp;n]</code> contains a total of <code>n!</code> unique permutations.

By listing and labeling all of the permutations in order, we get the following sequence for <code>n = 3</code>:

<ol>
	<li><code>&quot;123&quot;</code></li>
	<li><code>&quot;132&quot;</code></li>
	<li><code>&quot;213&quot;</code></li>
	<li><code>&quot;231&quot;</code></li>
	<li><code>&quot;312&quot;</code></li>
	<li><code>&quot;321&quot;</code></li>
</ol>

Given <code>n</code> and <code>k</code>, return the <code>kth</code> permutation sequence.

&nbsp;
Example 1:
<pre>Input: n = 3, k = 3
Output: "213"
</pre>Example 2:
<pre>Input: n = 4, k = 9
Output: "2314"
</pre>Example 3:
<pre>Input: n = 3, k = 1
Output: "123"
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 9</code></li>
	<li><code>1 &lt;= k &lt;= n!</code></li>
</ul>

getPermutation

Permutation Sequence

Next Permutation

next-permutation

下一个排列

Permutations

permutations

全排列

Recursion

Math

给出集合 <code>[1,2,3,...,n]</code>，其所有元素共有 <code>n!</code> 种排列。

按大小顺序列出所有排列情况，并一一标记，当 <code>n = 3</code> 时, 所有排列如下：

<ol>
	<li><code>"123"</code></li>
	<li><code>"132"</code></li>
	<li><code>"213"</code></li>
	<li><code>"231"</code></li>
	<li><code>"312"</code></li>
	<li><code>"321"</code></li>
</ol>

给定 <code>n</code> 和 <code>k</code>，返回第 <code>k</code> 个排列。

 

示例 1：

<pre>
输入：n = 3, k = 3
输出："213"
</pre>

示例 2：

<pre>
输入：n = 4, k = 9
输出："2314"
</pre>

示例 3：

<pre>
输入：n = 3, k = 1
输出："123"
</pre>

 

提示：

<ul>
	<li><code>1 <= n <= 9</code></li>
	<li><code>1 <= k <= n!</code></li>
</ul>