代码随想录一刷: 补Day29

最新推荐文章于 2024-06-10 22:18:41 发布

m0_59079503

最新推荐文章于 2024-06-10 22:18:41 发布

阅读量47

点赞数

文章标签： python 数据挖掘机器学习

本文链接：https://blog.csdn.net/m0_59079503/article/details/131217737

版权

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

文章目录

前言
一、递增子序列
二、全排列
三、全排列II
总结
总结

前言

每日刷题，从己做起。

一、递增子序列

class Solution:
    def findSubsequences(self, nums: List[int]) -> List[List[int]]:
        result = []
        path = []
        self.backtracking(nums, 0, path, result)
        return result

    def backtracking(self, nums, startindex, path, result):
        if len(path) > 1:
            result.append(path[:])

        uset = set()
        for i in range(startindex, len(nums)):
            if (path and nums[i] < path[-1]) or nums[i] in uset:
                continue
            
            uset.add(nums[i])
            path.append(nums[i])
            self.backtracking(nums, i + 1, path, result )
            path.pop()

二、全排列

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        result = []
        self.backtracking(nums, [], [False] * len(nums), result )
        return result

    def backtracking(self, nums, path, used, result):
        if len(path) == len(nums):
            result.append(path[:])
            return
        for i in range(len(nums)):
            if used[i]:
                continue
            used[i] = True
            path.append(nums[i])
            self.backtracking(nums, path, used, result)
            path.pop()
            used[i] = False

三、全排列II

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