LeetCode46. 全排列两种方法：(DFS) + (import itertools)

最新推荐文章于 2024-10-08 20:49:48 发布

Minkowski_lin

最新推荐文章于 2024-10-08 20:49:48 发布

阅读量281

点赞数

本文链接：https://blog.csdn.net/qq_42991793/article/details/87927410

版权

Python 同时被 3 个专栏收录

22 篇文章 0 订阅

订阅专栏

LeetCode

17 篇文章 0 订阅

订阅专栏

图论

9 篇文章 0 订阅

订阅专栏

LeetCode46. 全排列(DFS)

class Solution:
    def __init__(self):
        self.v = None
        self.n = None
        self.tmp = []
        self.ans = []

    def permute(self, nums):
        self.n = len(nums)
        self.v = [False for _ in range(self.n)]
        self.tmp = [0 for _ in range(self.n)]
        self.dfs(nums, 0)
        return self.ans

    def dfs(self, nums, depth):
        if depth == self.n:
            self.ans.append(self.tmp.copy())
            return
        else:
            for i in range(self.n):
                if not self.v[i]:
                    self.v[i] = True
                    self.tmp[depth] = nums[i]
                    self.dfs(nums, depth + 1)
                    self.v[i] = False

if __name__ == '__main__':
    a = [1, 2, 3]
    s = Solution()
    print(s.permute(a))

result

[[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]

简易版

import itertools


class Solution:
    def permute(self, nums):
        tmp = list(itertools.permutations(nums))
        ans = [list(t) for t in tmp]
        return ans


if __name__ == '__main__':
    a = [1, 2, 3]
    s = Solution()
    print(s.permute(a))