LeetCode动态规划300|674|718

最新推荐文章于 2024-07-09 23:43:07 发布

Erin Wang

最新推荐文章于 2024-07-09 23:43:07 发布

阅读量176

点赞数 2

分类专栏： LeetCode 文章标签： leetcode 动态规划算法

本文链接：https://blog.csdn.net/ErinWang666/article/details/137127232

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

300最长递增子序列

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        dp = [1] * len(nums)
        result = 1
        for i in range(1, len(nums)):
            for j in range(i):
                if nums[i] > nums[j]:
                    dp[i] = max(dp[j] + 1, dp[i])
            if dp[i] > result:
                result = dp[i]
        return result

674最长连续递增序列

class Solution:
    def findLengthOfLCIS(self, nums: List[int]) -> int:
        dp = [1] * len(nums)
        result = 1
        for i in range(1, len(nums)):
            if nums[i] > nums[i - 1]:
                dp[i] = dp[i - 1] + 1
            if dp[i] > result:
                result = dp[i]
        return result

718最长重复子数组

class Solution:
    def findLength(self, nums1: List[int], nums2: List[int]) -> int:
        dp = [[0] * (len(nums2) + 1) for _ in range(len(nums1) + 1)]
        result = 0
        for i in range(1, len(nums1) + 1):
            for j in range(1, len(nums2) + 1):
                if nums1[i - 1] == nums2[j - 1]:
                    dp[i][j] = dp[i - 1][j - 1] + 1
                if dp[i][j] > result:
                    result = dp[i][j]
        return result