DP解法,时间复杂度O(MN): def dp(s1, s2): m, n = len(s1) + 1, len(s2) + 1 li = [[0] * m for _ in range(n)] max_len = 0 for row in range(1, n): for col in range(1, m): if s1[col - 1] == s2[row - 1]: if li[row - 1][col - 1]: li[row][col] =...