C++实现求最长公共子序列（LCS）与最长公共子串(DP)

 

#include <iostream>
#include<algorithm>
#include<vector>
#include <string>
using namespace std;

int lcs(string str1, string str2) //最长公共子序列
{
	int len1 = str1.size();
	int len2 = str2.size();
	vector<vector<int>> c(len1 + 1, vector<int>(len2 + 1));

	for (int i = 0; i <= len1; i++) {
		for (int j = 0; j <= len2; j++) {
			if (i == 0 || j == 0) {
				c[i][j] = 0;
			}
			else if (str1[i - 1] == str2[j - 1]) {
				c[i][j] = c[i - 1][j - 1] + 1;
			}
			else {
				c[i][j] = max(c[i - 1][j], c[i][j - 1]);
			}
		}
	}
	return c[len1][len2];
}
int lcs1(string str1, string str2) //最长公共子串
{
	int len1 = str1.size();
	int len2 = str2.size();
	int result = 0;     //记