day_43

阿远_LIFE

已于 2024-08-14 23:15:19 修改

阅读量57

点赞数 1

分类专栏：刷题文章标签： python 算法力扣

于 2024-08-14 23:11:16 首次发布

本文链接：https://blog.csdn.net/wzy_777/article/details/141202143

版权

刷题专栏收录该内容

38 篇文章 0 订阅

订阅专栏

300. 最长递增子序列

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

674. 最长连续递增序列

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

718. 最长重复子数组

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