class Solution:
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
# O(MN) O(MN)
m = len(text1)
n = len(text2)
dp = [[0]*(n+1) for _ in range(m+1)]
for i in range(1,m+1):
for j in range(1,n+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[m][n]
每日一道Leetcode - 1143. 最长公共子序列 【动态规划】
最新推荐文章于 2024-09-15 22:31:42 发布