最长公共子序列长度及具体的子序列

给定两个字符串str1和str2，输出连个字符串的最长公共子序列。如过最长公共子序列为空，则输出-1。

“1A2C3D4B56”,“B1D23CA45B6A”

返回值

“123456”

拿到dp数组之后倒推出最长公共子序列
具体解析

#
# longest common subsequence
# @param s1 string字符串 the string
# @param s2 string字符串 the string
# @return string字符串
#
class Solution:
    def LCS(self , s1 , s2 ):
        # write code here
        m, n = len(s1), len(s2)
        dp = [[0]*(n+1) for _ in range(m+1)]
        for i in range(1, m+1):
            for j in range(1, n+1):
                if s1[i-1] == s2[j-1]:
                    dp[i][j] = dp[i-1][j-1] + 1
                else:
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1])
        if dp[-1][-1] == 0:
            return -1
        i, j = m, n
        ans = []
        while i >=1 and j >= 1:
            if s1[i-1] == s2[j-1]:
                ans.append(s1[i-1])
                i -= 1
                j -= 1
            else:
                if dp[i-1][j] > dp[i][j-1]:
                    i -= 1
                else:
                    j -= 1
        return "".join(reversed(ans))