1、最长公共子序列
class Solution:
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
dp = [[0]*(len(text2)+1) for i in range((len(text1)+1))]
for i in range(1, len(text1)+1):
for j in range(1, len(text2)+1):
if text1[i-1] == text2[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
# 不要求连续的做法,从上方或左方更新
# 两元素不相同的情况下,看text1[:i-1]和text2,text2[:j-1]和text1的最长子序列长度
else:
dp[i][j] = max(dp[i-1][j],dp[i][j-1])
return dp[-1][-1]
2、不相交的线
class Solution:
def maxUncrossedLines(self, nums1: List[int], nums2: List[int]) -> int:
dp = [[0]*(len(nums2)+1) for _ in range(len(nums1)+1)]
for i in range(1, len(nums1)+1):
for j in range(1, len(nums2)+1):
if nums1[i-1] == nums2[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
return dp[-1][-1]
数组版的第一题,没啥好说的
3、最大子数组和
class Solution: # donggui
def maxSubArray(self, nums: List[int]) -> int:
# dp含义:每个数的最大连续子数组和
dp = [0]*(len(nums))
# 初始化
dp[0] = nums[0]
for i in range(1,len(nums)):
# 如果i之前的和为负,相当于从i开始重新计算
dp[i] = max(nums[i], nums[i] + dp[i-1])
return max(dp)
4、判断子序列
class Solution:
def isSubsequence(self, s: str, t: str) -> bool:
if len(s) > len(t):
return False
# dp含义:dp[i][j]代表i-1,j-1处子序列长度
dp = [[0]*(len(t)+1) for _ in range(len(s)+1)]
for i in range(1,len(s)+1):
for j in range(1, len(t)+1):
if s[i-1] == t[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
# 由于判断s是否为t的子序列,所以只用从t[j-1]更新
else:
dp[i][j] = dp[i][j-1]
# 遍历完最后的子序列如果跟s一样长,说明是子序列,否则应该没有s长
return dp[-1][-1] == len(s)