动态规划
题意:
给你两个字符串, 要你求出两个字符串的最长公共子序列长度.
分析:
- dp[i][j]==x表示A串的前i个字符和B串的前j个字符的最长公共子序列长度为x.
- 初始化: dp全为0.
- 状态转移:
- 最终所求: dp[n][m].
参考:https://blog.csdn.net/u013480600/article/details/40741333
//动态规划
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
const int maxn = 1005;
int n, m;
int dp[maxn][maxn];
char s1[maxn], s2[maxn];
int main() {
int i, j;
while (cin >> s1 >> s2) {
n = strlen(s1), m = strlen(s2);
memset(dp, 0, sizeof(dp));
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; 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[n][m] << endl;
}
return 0;
}