public class LongestCommonSubsequence {
public static int longestCommonSubsequence(String text1, String text2) {
int m = text1.length();
int n = text2.length();
int[][] dp = new int[m+1][n+1];
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (text1.charAt(i-1) == text2.charAt(j-1)) {
dp[i][j] = dp[i-1][j-1] + 1;
} else {
dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);
}
}
}
return dp[m][n];
}
public static void main(String[] args) {
String text1 = "abcde";
String text2 = "ace";
System.out.println(longestCommonSubsequence(text1, text2));
text1 = "abc";
text2 = "def";
System.out.println(longestCommonSubsequence(text1, text2));
text1 = "abcdefg";
text2 = "abcde";
System.out.println(longestCommonSubsequence(text1, text2));
}
}