class Solution:
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
len1,len2 = len(text1),len(text2)
#dp[i][j] [0,i-1]和[0,j-1]的最长公共子序列
dp = [[0]*(len2+1) for _ in range(len1+1)]
res = 0
for i in range(1,len1+1):
for j in range(1,len2+1):
if text1[i-1] == text2[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[len1][len2]
1143. 最长公共子序列
最新推荐文章于 2024-10-20 10:43:07 发布