题解 | #公共子串计算#
公共子串计算
http://www.nowcoder.com/practice/98dc82c094e043ccb7e0570e5342dd1b
const readline = require('readline');
const rl = readline.createInterface({
input: process.stdin,
output: process.stdout
});
var list = [];
rl.on('line', function (line) {
list.push(line);
});
rl.on('close', function () {
var lStr = list[0].length>list[1].length?list[0]:list[1];
var sStr = list[0].length>list[1].length?list[1]:list[0];
var max = 0;
for (var i = 0; i < sStr.length; i++) {
for (var j=i+1;j<=sStr.length; j++) {
var substring = sStr.slice(i, j);
if (lStr.match(substring)) {
max = substring.length>max?substring.length:max;
}
}
}
console.log(max);
});
