Given an array nums of distinct integers, return every possible permutation. You can return them in any order.
Examples
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 numbers in
numsare distinct.