Longest Common Subsequence

1public int longestCommonSubsequence(String text1, String text2) {
2    int m = text1.length();
3    int n = text2.length();
4    int[][] dp = new int[m + 1][n + 1];
5
6    for (int i = 1; i <= m; i++) {
7        for (int j = 1; j <= n; j++) {
8            if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
9                dp[i][j] = dp[i - 1][j - 1] + 1;
10            } else {
11                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
12            }
13        }
14    }
15
16    return dp[m][n];
17}