All Permutations of an Array
MediumP1Coding
Given an array nums of distinct integers, return all possible permutations. The permutations may be returned 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] <= 10
- All values are distinct.
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 9. ⌘Enter runs, ⌘⇧Enter submits.