Leetcode1092. Shortest Common Supersequence

最新推荐文章于 2024-09-10 13:01:50 发布

Enzoen

最新推荐文章于 2024-09-10 13:01:50 发布

阅读量350

点赞数 4

文章标签： python leetcode

本文链接：https://blog.csdn.net/weixin_50796535/article/details/136227908

版权

本文介绍了一个编程问题，要求找到两个给定字符串str1和str2的最短公共超序列。使用动态规划方法实现的Solution类中的lcs函数计算最长公共子序列，然后通过遍历并调整字符串来构造最短公共超序列。

摘要由CSDN通过智能技术生成

Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If there are multiple valid strings, return any of them.

A string s is a subsequence of string t if deleting some number of characters from t (possibly 0) results in the string s.

Example 1:

Input: str1 = "abac", str2 = "cab"
Output: "cabac"
Explanation: 
str1 = "abac" is a subsequence of "cabac" because we can delete the first "c".
str2 = "cab" is a subsequence of "cabac" because we can delete the last "ac".
The answer provided is the shortest such string that satisfies these properties.

Example 2:

Input: str1 = "aaaaaaaa", str2 = "aaaaaaaa"
Output: "aaaaaaaa"

class Solution:
    def shortestCommonSupersequence(self, A: str, B: str) -> str:
        # instead of record length of lcs, we need to modify lcs for record path
        def lcs(A, B):
            n, m = len(A), len(B)
            dp = [["" for _ in range(m + 1)] for _ in range(n + 1)]
            for i in range(n):
                for j in range(m):
                    if A[i] == B[j]:
                        dp[i + 1][j + 1] = dp[i][j] + A[i]
                    else:
                        dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1], key=len)
            return dp[-1][-1]

        # we iterate through each string, if chr not in common subsequence, we add it to res seperately
        # if chr in common subsequence, we add to res. Finally, since we end for loop at the end of lcs,
        # we add the right part of each string back
        res, i, j = "", 0, 0
        for c in lcs(A, B):
            while A[i] != c:
                res += A[i]
                i += 1
            while B[j] != c:
                res += B[j]
                j += 1
            res += c
            i, j = i + 1, j + 1
        return res + A[i:] + B[j:]

LCS变体