Permutations
Given an array nums of distinct integers, return all possible permutations of the elements.
A permutation is a rearrangement of all the elements of an array.
You may 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]]The three distinct numbers can be arranged in 6 different orders.
Example 2
Input
nums = [0,1]Output
[[0,1],[1,0]]A single-element array has exactly one permutation: itself.
Constraints
- 1 <= nums.length <= 6
- -10 <= nums[i] <= 10
- All the integers of nums are unique.