最长公共子序列

def lcs(____):
    m, n = len(____), len(____)
    dp = [[____] * (____) for _ in range(____)]
    for i in range(____, m + ____):
        for j in range(____, n + ____):
            if text1[i - ____] == text2[j - ____]:
                dp[i][j] = dp[i - ____][j - ____] + ____
            else:
                dp[i][j] = max(____)
    return dp[m][n]