Subsets (Power Set)Combination Sum

Permutations

medium

Time: O(n * n!)

Space: O(n)

Given an array of distinct integers, return all possible permutations.

Constraints

1 <= nums.length <= 6

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

Input: nums = [0,1]

Output: [[0,1],[1,0]]