1143. 最长公共子序列

• F[i,j]表示前缀子串A[1-i]与B[1-j]的“最长公共子序列”的长度
  $$F[i,j]=\max \{\begin{array}{l}F[i-1,j]\\ F[i,j-1]\\ F[i-1,j-1]+1(ifA[i]=B[i])\end{array}$$
• F[i, 0] = F[0, j] = 0

public int longestCommonSubsequence(String text1, String text2) {
        int n1 = text1.length();
        int n2 = text2.length();

        int[][] dp = new int[2][n2+1];

        for (int i = 1; i <= n1; i++) {
            for (int j = 1; j <= n2; j++) {
                if (text1.charAt(i-1) == text2.charAt(j-1)) {
                    dp[i%2][j] = 1 + dp[(i-1)%2][j-1];
                } else {
                    dp[i%2][j] = Math.max(dp[(i-1)%2][j], dp[i%2][j-1]);
                }
            }
        }

        return dp[n1%2][n2];
    }