1143. Longest Common Subsequence

最新推荐文章于 2024-11-10 14:06:08 发布

Koneeeeeee

最新推荐文章于 2024-11-10 14:06:08 发布

阅读量74

点赞数

分类专栏：算法文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_44420980/article/details/117172727

版权

算法专栏收录该内容

13 篇文章 0 订阅

订阅专栏

该博客探讨了如何使用动态规划求解两个字符串的最长公共子序列（LCS）问题。代码示例分别展示了C++和Python的实现，通过二维数组dp进行状态转移。当字符相同时，LCS长度加一，否则取之前两个状态的最大值。

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

大概是最最基础的dp？
Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.

A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

For example, “ace” is a subsequence of “abcde”.
A common subsequence of two strings is a subsequence that is common to both strings.

不看提示还真想不出来

class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        //这题相比起第10题模式匹配温柔多了
        int l1 = text1.size();
        int l2 = text2.size();
        vector<vector<int>> dp(l1 + 1, vector<int>(l2 + 1));
        for(int i = 1; i <= l1; i++) {
            for(int j = 1; j <= l2; j++) {
                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[l1][l2];
    }
};

class Solution:
    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
        l1, l2 = len(text1), len(text2)
        # notice the length of array
        dp = [[0] * (l2 + 1) for _ in range(l1 + 1)]
        for i in range(1, l1 + 1):
            for j in range(1, l2 + 1):
                if text2[j - 1] == text1[i - 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[l1][l2]