300. 最长递增子序列
class Solution:
def lengthOfLIS(self, nums: List[int]) -> int:
#dp数组的含义
dp = [1]*len(nums)
# dp[0] =1
for i in range(1,len(nums)):
for j in range(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
return max(dp)
718. 最长重复子数组
class Solution:
def findLength(self, nums1: List[int], nums2: List[int]) -> int:
result = 0
dp = [[0] *(len(nums2)) for _ in range(len(nums1))]
for i in range(len(nums1)):
if nums2[0] == nums1[i]:
dp[i][0] = 1
result =1
for i in range(len(nums2)):
if nums1[0] == nums2[i]:
dp[0][i] = 1
result =1
for i in range(1,len(nums1)):
for j in range(1,len(nums2)):
if nums1[i] == nums2[j]:
dp[i][j]=dp[i-1][j-1]+1
result =max(result,dp[i][j])
return result