最长公共子序列

KY114 Coincidence

牛客链接

上海交大复试上机题

• 时间限制：1秒  空间限制：64M

题目描述

Find a longest common subsequence of two strings.

输入描述：

First and second line of each input case contain two strings of lowercase character a…z. There are no spaces before, inside or after the strings. Lengths of strings do not exceed 100.

输出描述：

For each case, output k – the length of a longest common subsequence in one line.

示例1

输入：

abcd
cxbydz
输出：

2

解题方法

思路

动态规划子序列问题

代码

#include <bits/stdc++.h>
using namespace std;
int main(){
    string s1,s2;
    cin>>s1>>s2;
    vector<vector<int>> dp(s1.size()+1,vector<int>(s2.size()+1,0));//主要是第一行与第一列需要初始化为0
    for(int i=1;i<=s1.size();i++){
        for(int j=1;j<=s2.size();j++){
            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]);
        }
    }
    cout<<dp[s1.size()][s2.size()]<<endl;

    return 0;
}