第九章 动态规划(十三)
主要内容
子序列问题
动态规划题目
300.最长递增子序列
代码
class Solution:
# dp[i]表示以nums[i]结尾的最长递增子序列长度
# 递推公式 dp[i] 为 dp[j] + 1 的最大值 对于 j<i and nums[i]>nums[j]
def lengthOfLIS(self, nums: List[int]) -> int:
result = 1
n = len(nums)
dp = [1] * n
for i in range(1, n):
for j in range(i):
if nums[i] > nums[j]:
dp[i] = max(dp[i], dp[j] + 1)
result = max(result, dp[i])
return result
674. 最长连续递增序列
代码
class Solution:
def findLengthOfLCIS(self, nums: List[int]) -> int:
n = len(nums)
res = 1
dp = [1] * n
for i in range(n-1):
if nums[i+1]>nums[i]:
dp[i+1] = dp[i] + 1
res = max(res, dp[i+1])
return res
# def findLengthOfLCIS(self, nums: List[int]) -> int:
# res = 1
# cur = 1
# n = len(nums)
# for i in range(1, n):
# if nums[i] > nums[i - 1]:
# cur += 1
# res = max(res, cur)
# else:
# cur = 1
# return res
718. 最长重复子数组
代码
class Solution:
# dp[i][j]: 以nums1[i-1], nums2[j-1] 结尾的最长公共子数组长度
# 递推公式 dp[i][j] = dp[i-1][j-1]+1
def findLength(self, nums1: List[int], nums2: List[int]) -> int:
m, n = len(nums1), len(nums2)
res = 0
dp = [[0] * (n+1) for _ in range(m+1)]
for i in range(1, m+1):
for j in range(1, n+1):
if nums1[i - 1] == nums2[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + 1
res = max(res, dp[i][j])
return res