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