leetcode 46.全排列(python)

leetcode 46.全排列(python)

给定一个 没有重复 数字的序列，返回其所有可能的全排列。

示例:

输入: [1,2,3]
输出:
[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]

回溯

class Solution(object):
    def permute(self, nums):
        # 回溯
        visited = res = []
        self.backtrack(visited, [], nums, res)
        return res
    
    def backtrack(self, visited, subset, nums, res):
        if len(subset) == len(nums):
            res.append(subset)
        for i in range(len(nums)):
            if i not in visited:
                visited.append(i)
                self.backtrack(visited, subset + [nums[i]], nums, res)
                visited.remove(i)

DFS

class Solution(object):
    def permute(self, nums):
        # DFS
        def dfs(nums, path, res):
            if not nums:
                res.append(path)
            for i in range(len(nums)):
                dfs(nums[:i] + nums[i+1:], path + [nums[i]], res)

        res = []
        dfs(nums, [], res)
        return res