<doocs>1143.Longest Common Subsequence_1.py
def longestCommonSubsequence( text1: str, text2: str) -> int:
    m, n = len(text1), len(text2)
    dp = [[0] * (n + 1) for _ 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]
def sample_funcname ( var_0 : str , var_2 : str ) -> int :
    var_5 , var_6 = len ( var_0 ) , len ( var_2 )
    var_11 = [ [ 0 ] * ( var_6 + 1 ) for var_9 in range ( var_5 + 1 ) ]
    for var_12 in range ( 1 , var_5 + 1 ) :
        for var_13 in range ( 1 , var_6 + 1 ) :
            if var_0 [ var_12 - 1 ] == var_2 [ var_13 - 1 ] :
                var_11 [ var_12 ] [ var_13 ] = var_11 [ var_12 - 1 ] [ var_13 - 1 ] + 1
            else :
                var_11 [ var_12 ] [ var_13 ] = max ( var_11 [ var_12 - 1 ] [ var_13 ] , var_11 [ var_12 ] [ var_13 - 1 ] )
    return var_11 [ - 1 ] [ - 1 ]
