46.md

题目地址

https://leetcode-cn.com/problems/permutations/

解答

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        """ 全排列,给定一个没有重复数字的序列，返回其所有可能的全排列。 """
        res = []
        self.dfs(nums, [], res)
        return res

    def dfs(self, nums, path, res):
        if not nums:
            res.append(path)
        for i in range(len(nums)):
            self.dfs(nums[:i] + nums[i + 1:], path + [nums[i]], res)