Find All Permutations

Given an array nums of n distinct integers, return all possible permutations of nums. You may return the answer in any order.

A permutation is an arrangement of all the elements of the array into some sequence. For an array of length n there are exactly n! distinct permutations.

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]]

Constraints:

• 1 <= nums.length <= 6
• -10 <= nums[i] <= 10
• All integers in nums are unique.