最长公共子序列-输出序列

def lcs_string(____):
    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(____)
    i, j = m, n
    result = []
    while i > ____ and j > ____:
        if text1[i - ____] == text2[j - ____]:
            result.append(____)
            i -= ____
            j -= ____
        elif dp[i - ____][j] > dp[i][j - ____]:
            i -= ____
        else:
            j -= ____
    return '____'.join(reversed(____))