题解 | 最长公共子序列(一)

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        int num1 = in.nextInt();
        int num2 = in.nextInt();
        String str1 = in.next();
        String str2 = in.next();
        int n1 = str1.length();
        int n2 = str2.length();

        int count = 0;
        int[][] dp = new int[n1 + 1][n2 + 1];
        for (int i = 1; i <= n1; i++) {
            for (int j = 1; j <= n2; j++) {
                if (str1.charAt(i - 1) == str2.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]);
                }
                // System.out.println(i + " " + j + " " + dp[i][j]);
            }
        }
        System.out.println(dp[n1][n2]);
    }
}