题解 | #公共子串计算#

三个循环暴力破解

let line;
let strs = [];
while (line = readline()) {
    strs.push(line);
}
let maxLength = 0; // 最大长度
let count = 0; // 当前循环统计的最大长度
let first = strs[0].split('');
let second = strs[1].split('');
for (let i = 0; i < first.length; i++) {
    for (let j = 0; j < second.length; j++) {
        let a = i, b = j;
        while (a < first.length && b < second.length && first[a] == second[b]) {
            a++;
            b++;
            count++;
        }
        if (count > maxLength) {
            maxLength = count;
        }
        count = 0;
    }
}
print(maxLength);