[leetCode] 46. Permutations (Python)

Given a collection of distinct integers, return all possible permutations.

 

Example:

Input: [1,2,3]
Output:
[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]

Solution

from itertools import permutations

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        
        permu = list(permutations(nums, len(nums)))
        
        return permu

 

SOMJANG/CODINGTEST_PRACTICE