LCS最长公共子序列【Python】

算法作业

# 最长公共子序列
s1 = input("输入第一个字符串")
s2 = input("输入第二个字符串")
# s1 = 'ACCGGTC'
# s2 = 'GTCGTTC'

len1 = len(s1)
len2 = len(s2)
# 集合存储，便于去重
res_set = set()
cur_list = []

# s1为列，s2为行构造dp、方向矩阵
dp = [[0 for i in range(len2 + 1)] for j in range(len1 + 1)]
for i in range(len(s1)):
    for j in range(len(s2)):
        if s1[i] == s2[j]:
            dp[i + 1][j + 1] = dp[i][j] + 1
        else:
            dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])


# 求所有最长公共子序列
def find_LCS(dp, s1, s2, i, j, res_set, cur_list):
    if dp[i][j] == 0:
        res_set.add(''.join(cur_list[::-1]))
        return
    elif s1[i - 1] == s2[j - 1]:
        cur_list.append(s1[i - 1])
        find_LCS(dp, s1, s2, i - 1, j - 1, res_set, cur_list)
        cur_list.pop()
    else:
        if dp[i][j - 1] >= dp[i - 1][j]:
            find_LCS(dp, s1, s2, i, j - 1, res_set, cur_list)
        if dp[i - 1][j] >= dp[i][j - 1]:
            find_LCS(dp, s1, s2, i - 1, j, res_set, cur_list)


find_LCS(dp, s1, s2, len1, len2, res_set, cur_list)

print("最长子序列长度为：", dp[len1][len2])
print("所有最长公共子序列为：")
for res in res_set:
    print(res)