[保研/考研机试] KY114 Coincidence 上海交通大学复试上机题 C++实现

题目链接：

Coincidence_牛客题霸_牛客网Find a longest common subsequence of two stri。题目来自【牛客题霸】https://www.nowcoder.com/share/jump/437195121693065251425

描述

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<iostream>
#include<cstring>
#include<string>
using namespace std;

const int N = 100;
int main()
{
	string s1, s2;
	int dp[N][N];
	memset(dp, 0, sizeof(dp));
	while (cin >> s1>>s2) {
		int n = s1.size();
		int m = s2.size();
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (s1[i] == s2[j]) {
					dp[i + 1][j + 1] = dp[i][j] + 1;
				}
				else {
					dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
				}
			}
		}
		cout << dp[n][m] << endl;
	}

	return 0;
}

提交结果：