给定两个只包含小写字母的字符串，计算两个字符串的最大公共子串的长度。

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

    Scanner scanner = new Scanner(System.in);

    String nextLine = scanner.nextLine();
    String nextLine1 = scanner.nextLine();

    String lStr = nextLine.length() > nextLine1.length() ? nextLine : nextLine1;
    String sStr = nextLine.length() < nextLine1.length() ? nextLine : nextLine1;

    int max = 0;
    for (int i = 0; i < sStr.length(); i++) {
        for (int j = i + 1; j <= sStr.length(); j++) {
            String substring = sStr.substring(i, j);
            if (lStr.contains(substring)) {
                max = substring.length() > max ? substring.length() : max;
            }
        }
    }
    System.out.println(max);
}

}