题解 | 公共子串计算

import java.util.ArrayList;
import java.util.List;
import java.util.Objects;
import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str1 = in.nextLine();
        String str2 = in.nextLine();

        String strShort = str1.length() <=
                str2.length() ? str1 : str2;
        String strLong = str1.length() >
                str2.length() ? str1 : str2;

        int count = 0;
        if (strLong.contains(strShort)) {
            System.out.println(strShort.length());
            return;
        }

        for (int i = 0; i < strShort.length() - 2; i++) {
            for (int j = i+1; j < strShort.length() - 1; j++) {
                if (strLong.contains(strShort.substring(i,j))) {
                    count = Math.max(count, j-i);
                }
            }
        }
        System.out.println(count);
    }
}