#46

Permutations

pupil · 415 · lc medium +25 · verified · 81.7% accepted · 20,759 likes · top 93%

Description

Given an array nums of distinct integers, return every possible ordering (permutation) of its elements 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]]

Example 2:

Input: nums = [0,1]

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

Example 3:

Input: nums = [1]

Output: [[1]]

Code

1

2

3

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]: