一、题目
二、代码
class Solution
{
public int longestCommonSubsequence(String text1, String text2)
{
int i,j;
int return_num = 0;
int length_1 = text1.length();
int length_2 = text2.length();
int[][] dp = new int[length_1+1][length_2+1];
//子字符串不要求连续
for(i=1;i<=length_1;i++)
{
for(j=1;j<=length_2;j++)
{
if(text1.charAt(i-1) == text2.charAt(j-1))
{
dp[i][j] = dp[i-1][j-1]+1;
if(dp[i][j]>return_num) return_num = dp[i][j];
}
else
{
dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
if(dp[i][j]>return_num) return_num = dp[i][j];
}
}
}
return return_num;
}
}