mediumBacktracking
Permutations
## Problem
Given an array `nums` of **distinct** integers, return *all the possible permutations*. You can return the answer in **any order**.
Given an array `nums` of **distinct** integers, return *all the possible permutations*. You can return the answer in **any order**.
Examples
Input
nums = [1,2,3]
Output
[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
All 6 permutations.
Input
nums = [0,1]
Output
[[0,1],[1,0]]
Two permutations.
Input
nums = [1]
Output
[[1]]
One permutation.
Constraints
1 <= nums.length <= 6
-10 <= nums[i] <= 10
All the integers of nums are unique.
Python
Loading...