最长公共子序列
#include <iostream>
#include "string"
#include<vector>
using namespace std;
// 状态:dp[i][j] 表示s1中第i个字符和s2中第j个字符表示的最长公共子序列
// 状态转移:dp[i][j] = max(dp[i-1][j], dp[i][j-1])
int lcs(const string &s1, const string &s2) {
if (s1.length() == 0 || s2.length() == 0) return 0;
int len1 = s1.length();
int len2 = s2.length();
vector<vector<int>> dp(len1+1, vector<int>(len2+1, 0));
for (int i = 1; i <= len1; i++) {
for (int j = 1; j <= len2; j++) {
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
if (s1[i-1] == s2[j-1]) dp[i][j] += 1;
}
}
//输出中间结果
for (int i = 0; i <= len1; i++) {
for (int j = 0; j <= len2; j++) {
cout << dp[i][j] << " ";
}
cout << endl;
}
return dp[len1][len2];
}
int main() {
string s1 = "ABCD";
string s2 = "AEBD";
int res = lcs(s1, s2);
cout << res << endl;
}