1143. 最长公共子序列
常规动态规划
class Solution: def longestCommonSubsequence(self, text1: str, text2: str) -> int: n1, n2 = len(text1), len(text2) dp = [[0] * (n2 + 1) for _ in range(n1 + 1)] for i in range(1, n1 + 1): for j in range(1, n2 + 1): if text1[i - 1] == text2[j - 1]: dp[i][j] = 1 + dp[i-1][j-1] else: dp[i][j] = max( dp[i-1][j],dp[i][j-1] ) return dp[-1][-1]
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)