考研机试真题--Coincidence--上海交通大学

关键字：最长公共子序列

题目描述
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

链接：
https://www.nowcoder.com/practice/f38fc44b43cf44eaa1de407430b85e69?tpId=40&tqId=21445&tPage=1&rp=1&ru=/ta/kaoyan&qru=/ta/kaoyan/question-ranking

思路：
状态设计：dp[i][j] 为s1前i，s2前j个时最长的公共子序列
状态转移方程：
if(s1[i] == s2[j]) dp[i][j] = dp[i - 1][j - 1] + 1;
else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);

代码：</