最长公共子序列 https://leetcode-cn.com/problems/longest-common-subsequence/

动态规划：

python
展开代码
class Solution:
    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
        m,n=len(text1),len(text2)
        dp=[[0]*(n+1) for i 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[-1][-1]

最长重复子数组 https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray/

动态规划：

python
展开代码
class Solution:
    def findLength(self, text1: List[int], text2: List[int]) -> int:
        m,n=len(text1),len(text2)
        dp=[[0]*(n+1) for i in range(m+1)]
        ans=0
        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]=0
                ans=max(dp[i][j],ans)
        return ans