permutations

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an array <code>nums</code> of distinct integers, return all the possible permutations. You can return the answer in any order.

&nbsp;
Example 1:
<pre>Input: nums = [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
</pre>Example 2:
<pre>Input: nums = [0,1]
Output: [[0,1],[1,0]]
</pre>Example 3:
<pre>Input: nums = [1]
Output: [[1]]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 6</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
	<li>All the integers of <code>nums</code> are unique.</li>
</ul>

permute

Permutations

Next Permutation

next-permutation

下一个排列

Permutations II

permutations-ii

全排列 II

Permutation Sequence

permutation-sequence

排列序列

Combinations

combinations

组合

Array

Backtracking

&#32473;&#23450;&#19968;&#20010;&#19981;&#21547;&#37325;&#22797;&#25968;&#23383;&#30340;&#25968;&#32452; <code>nums</code> &#65292;&#36820;&#22238;&#20854; &#25152;&#26377;&#21487;&#33021;&#30340;&#20840;&#25490;&#21015; &#12290;&#20320;&#21487;&#20197; &#25353;&#20219;&#24847;&#39034;&#24207; &#36820;&#22238;&#31572;&#26696;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [1,2,3]
&#36755;&#20986;&#65306;[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [0,1]
&#36755;&#20986;&#65306;[[0,1],[1,0]]
</pre>

&#31034;&#20363; 3&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [1]
&#36755;&#20986;&#65306;[[1]]
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= nums.length &lt;= 6</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
	<li><code>nums</code> &#20013;&#30340;&#25152;&#26377;&#25972;&#25968; &#20114;&#19981;&#30456;&#21516;</li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support