【算法题】最长公共子序列

最新推荐文章于 2022-01-13 16:32:44 发布

xiaxzhou

最新推荐文章于 2022-01-13 16:32:44 发布

阅读量381

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/xiaxzhou/article/details/74011889

版权

动态规划专栏收录该内容

24 篇文章 0 订阅

订阅专栏

d p [i] [j] = m a x ⎧ ⎩ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ d p [i - 1] [j] d p [i] [j - 1] d p [i - 1] [j - 1] + 1 if: str[i]==str[j]

$dp[i][j]=max \begin{cases} dp[i-1][j] & \\ \\ dp[i][j-1] & \\ \\ dp[i-1][j-1] +1 & \text{if: str[i]==str[j] } \end{cases}$

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <numeric>
#include <queue>

using namespace std;
//#define debug_

int func(string str1, string str2)
{
    vector<int> tmp(str2.size()+1);
    vector<vector<int>> dp(str1.size()+1,tmp);

    for (auto i = 1; i <= str1.size();++i)
    {
        for (auto j = 1; j <= str2.size();++j)
        {
            dp[i][j] = max(dp[i][j],dp[i][j-1]);
            dp[i][j] = max(dp[i][j], dp[i-1][j]);
            if (str1[i-1]==str2[j-1])
            {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);
            }
            else
            {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - 1]);
            }
        }
    }
    return dp[str1.size()][str2.size()];
}

int main()
{
    string str1;
    string str2;
#ifdef debug_
    str1 = "AAACCGTGAGTA";
    str2 = "CACCCCTAAGGTACCTT";
#else
    cin >> str1;
    cin >> str2;
#endif
    cout << func(str1, str2) << endl;
    return 0;
}