代码随想录算法训练营第四十三天|LeetCode 300 最长递增子序列，LeetCode 674 最长连续递增序列，LeetCode 718 最长重复子数组

1.LeetCode 300 最长递增子序列

题目链接：300. 最长递增子序列

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        if len(nums) < 2:
            return len(nums)
        
        dp = [1] * len(nums)
        result = 0
        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)
            result = max(result, dp[i])
        return result

第一题结束

2.LeetCode 674 最长连续递增序列

题目链接：674. 最长连续递增序列

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

3.LeetCode 718 最长重复子数组

题目链接：718. 最长重复子数组

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

第三题结束

今天用时1.5h