def longest_common_subsequence(text1, text2):
    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[m][n]
 
# 测试数据
text1 = "abcde"
text2 = "ace"
result = longest_common_subsequence(text1, text2)
print(result)
 
 

ZGVmIGxvbmdlc3RfY29tbW9uX3N1YnNlcXVlbmNlKHRleHQxLCB0ZXh0Mik6CiAgICBtLCBuID0gbGVuKHRleHQxKSwgbGVuKHRleHQyKQogICAgZHAgPSBbWzBdICogKG4gKyAxKSBmb3IgXyBpbiByYW5nZShtICsgMSldCgogICAgZm9yIGkgaW4gcmFuZ2UoMSwgbSArIDEpOgogICAgICAgIGZvciBqIGluIHJhbmdlKDEsIG4gKyAxKToKICAgICAgICAgICAgaWYgdGV4dDFbaSAtIDFdID09IHRleHQyW2ogLSAxXToKICAgICAgICAgICAgICAgIGRwW2ldW2pdID0gZHBbaSAtIDFdW2ogLSAxXSArIDEKICAgICAgICAgICAgZWxzZToKICAgICAgICAgICAgICAgIGRwW2ldW2pdID0gbWF4KGRwW2kgLSAxXVtqXSwgZHBbaV1baiAtIDFdKQoKICAgIHJldHVybiBkcFttXVtuXQoKIyDmtYvor5XmlbDmja4KdGV4dDEgPSAiYWJjZGUiCnRleHQyID0gImFjZSIKcmVzdWx0ID0gbG9uZ2VzdF9jb21tb25fc3Vic2VxdWVuY2UodGV4dDEsIHRleHQyKQpwcmludChyZXN1bHQpCgo=