day_43

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] + 1else:dp[i] = 1return 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] = 1else:dp[i][j] = dp[i - 1][j - 1] + 1res = 0for dpi in dp:res = max(res, max(dpi))return res