题目描述
解法:动态规划(C++)
class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
int rows = text1.size()+1;
int cols = text2.size()+1;
vector<vector<int>> dp(rows, vector<int>(cols, 0));
for(int i =1;i<rows;i++)
{
for(int j=1;j<cols;j++)
{
if(text1[i-1]==text2[j-1])
{
dp[i][j] = dp[i-1][j-1] + 1;
}
else
{
dp[i][j]= max(dp[i-1][j], dp[i][j-1]);
}
}
}
return dp[rows-1][cols-1];
}
};