Java LCR 095. 最长公共子序列

class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int l1 = text1.length(), l2 = text2.length();
        int[][] f = new int[l1 + 1][l2 + 1];
        for(int i = 1; i <= l1; i ++) {
            for(int j = 1; j <= l2; j++) {
                f[i][j] = Math.max(f[i - 1][j], f[i][j - 1]);
                if(text1.charAt(i - 1) == text2.charAt(j - 1)) {
                    f[i][j] = Math.max(f[i][j], f[i - 1][j - 1] + 1);
                }
            }
        }
        return f[l1][l2];
    }
}