Skip to content

Commit b0aaffa

Browse files
committed
Create README - LeetHub
1 parent 738bfcd commit b0aaffa

File tree

1 file changed

+21
-0
lines changed

1 file changed

+21
-0
lines changed

0046-permutations/README.md

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
<h2><a href="https://leetcode.com/problems/permutations/">46. Permutationsa>h2><h3>Mediumh3><hr><p>Given an array <code>numscode> of distinct integers, return all the possible <span data-keyword="permutation-array">permutationsspan>. You can return the answer in <strong>any orderstrong>.p>
2+
3+
<p>&nbsp;p>
4+
<p><strong class="example">Example 1:strong>p>
5+
<pre><strong>Input:strong> nums = [1,2,3]
6+
<strong>Output:strong> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
7+
pre><p><strong class="example">Example 2:strong>p>
8+
<pre><strong>Input:strong> nums = [0,1]
9+
<strong>Output:strong> [[0,1],[1,0]]
10+
pre><p><strong class="example">Example 3:strong>p>
11+
<pre><strong>Input:strong> nums = [1]
12+
<strong>Output:strong> [[1]]
13+
pre>
14+
<p>&nbsp;p>
15+
<p><strong>Constraints:strong>p>
16+
17+
<ul>
18+
  • 1 <= nums.length <= 6
  • 19+
  • -10 <= nums[i] <= 10
  • 20+
  • All the integers of nums are unique.
  • 21+
    ul>

    0 commit comments

    Comments
     (0)