题解 | #公共子串计算#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextLine()) { // 注意 while 处理多个 case
            String line1 = in.nextLine();
            String line2 = in.nextLine();
            if(line1.length()>line2.length()) {
                String c = line1;
                line1 = line2;
                line2 = c;
            }
            int maxLen =0;
            int[][]dp = new int[line1.length()+1][line2.length()+1];
            for(int i=1;i<=line1.length();i++) {
                for(int j=1;j<=line2.length();j++) {
                    if(line1.charAt(i-1) == line2.charAt(j-1)) {
                        dp[i][j] = dp[i-1][j-1] + 1;
                        maxLen = Math.max(maxLen, dp[i][j]);
                    }
                }
            }
            System.out.println(maxLen);
        }
    }
}