From 344c781673d92a3bdb65b2be22f2aa727c8ea5a5 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Fri, 13 Jan 2023 19:52:46 -0500 Subject: [PATCH] Create README - LeetHub --- 46-permutations/README.md | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 46-permutations/README.md diff --git a/46-permutations/README.md b/46-permutations/README.md new file mode 100644 index 0000000..25218c6 --- /dev/null +++ b/46-permutations/README.md @@ -0,0 +1,22 @@ +
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
+
Example 1:
+Input: nums = [1,2,3] +Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] +
Example 2:
+Input: nums = [0,1] +Output: [[0,1],[1,0]] +
Example 3:
+Input: nums = [1] +Output: [[1]] ++
+
Constraints:
+ +1 <= nums.length <= 6-10 <= nums[i] <= 10nums are unique.