题解 | #查找两个字符串a,b中的最长公共子串#

let input;
let time = 1;
let str1;
let str2;
while (input = readline()) {
//     第一个字符串
    if (time === 1) {
        str1 = input;
    }
//     第二个字符串
    if (time === 2) {
        str2 = input;
        let end = 0;
        let maxLen = 0;
        for (let i = 0; i < str1.length; i++) {
            for (let j = 0; j < str2.length; j++) {
                let a = i;
                let b = j;
                let count = 0;
                while (a < str1.length && b < str2.length && str1[a] === str2[b]) {
                    count++;
                    a++;
                    b++;
                }
                if (count > maxLen) {
                    maxLen = count;
                    end = str1.length > str2.length ? b : a;
                } else if (count === maxLen) {
                    const tmp = str1.length > str2.length ? b : a;
                    if (tmp < end) {
                        end = tmp;
                    }
                }
            }
        }
        if (str1.length > str2.length) {
            print(str2.slice(end - maxLen, end));
        } else {
            print(str1.slice(end - maxLen, end));
        }
        
//         重置，进入下一组数据
        time = 0;
    }
//     下一行
    time++;
}