LeetCode(力扣)46. 全排列Python

题目链接

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

代码

class Solution:
    def backtracking(self, nums, result, path, used):
        if len(path) == len(nums):
            result.append(path[:])
        
        for i in range(len(nums)):
            if used[i]:
                continue
            path.append(nums[i])
            used[i] = True
            self.backtracking(nums, result, path, used)
            path.pop()
            used[i] = False
    def permute(self, nums: List[int]) -> List[List[int]]:
        result = []
        self.backtracking(nums, result, [], [False] * len(nums))
        return result