LeetCode 46_ 全排列

1. 题目描述

2. 代码

import itertools
class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        n = len(nums)
        temp = itertools.permutations(nums)
        result = []
        for i in temp:
            result.append(list(i))
        return result

思路: 利用Python itertools内置库, permutations全排列, 比如输出123的全部情况.

from itertools import permutations
print(list(permutations('123')))

[('1', '2', '3'), ('1', '3', '2'), ('2', '1', '3'), ('2', '3', '1'), ('3', '1', '2'), ('3', '2', '1')]