1143 最长公共子序列 (有顺序,不连续)
输入:text1 = “abcde”, text2 = “ace”
输出:3
解释:最长公共子序列是 “ace”,它的长度为 3。
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
n = len(text1)
m = len(text2)
dp=[[0 for _ in range(m+1)]for _ in range(n+1)]
for i in range(1,n+1):
for j in range(1,m+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[-1][-1]
最长公共子串 (连续)
输入:1 2 3 4 5 6 7
1 2 8 9 3 4 5 7
输出: 3
[3,4,5]是最长公共子串
def longestSub(s1,s2):
n = len(s1)
m = len(s2)
max_len = 0
dp=[[0 for _ in range(m+1)]for _ in range(n+1)]
for i in range(1,n+1):
for j in range(1,m+1):
if text1[i-1] == text2[j-1]:
dp[i][j] = dp[i-1][j-1]+1
else:
dp[i][j] = 0
if dp[i][j] and max_len<dp[i][j]:
max_len = dp[i][j]
return max_len