动态规划
代码语言：javascript复制class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
int asize = text1.size();
int bsize = text2.size();
vector<vector<int>> dp(asize 1, vector<int>(bsize 1, 0));
for (int i = 1; i <= asize; i )
for (int j = 1; j <= bsize; 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[asize][bsize];
}
};
