题解 | 公共子串计算

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String a = scanner.nextLine();
        String b = scanner.nextLine();
        int lengthA = a.length();
        int lengthB = b.length();
        int[][] dp = new int[lengthA + 1][lengthB + 1];
        int maxLength = 0;

        for (int i = 1; i <= lengthA; i++) {
            for (int j = 1; j <= lengthB; j++) {
                if (a.charAt(i - 1) == b.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                    if (dp[i][j] > maxLength) {
                        maxLength = dp[i][j];
                    }
                } else {
                    dp[i][j] = 0;
                }
            }
        }
        System.out.println(maxLength);
    }
}