题目链接
https://leetcode.cn/problems/permutations/
文章来源地址https://www.toymoban.com/news/detail-701456.html
代码
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
文章来源：https://www.toymoban.com/news/detail-701456.html
到了这里，关于LeetCode(力扣)46. 全排列Python的文章就介绍完了。如果您还想了解更多内容，请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章，希望大家以后多多支持TOY模板网！
