GeezerVison is showing github.com — coding-problems/python/problem-45/script.py at main · fullstackmeetups/coding-problems

Expand file tree

script.py

Copy path

More file actions

30 lines (19 loc) · 564 Bytes

Copy path

30 lines (19 loc) · 564 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

'''

Given an array nums of distinct integers, return all the possible permutations. You can return the answer 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]]

Constraints:

1 <= nums.length <= 6

-10 <= nums[i] <= 10

All the integers of nums are unique.

'''

import itertools

def permute(nums):

return [list(mutation) for mutation in list(itertools.permutations(nums))]