给出两个字符串,找出其中连续的公共的子串的长度。
var str1 = 'qweasdf'
var str2 = 'asdfsfabc'
var count = 0
function MaxCommonStr(str1, str2) {
for (var i = 0; i < str1.length; i++) {
for (var j = str1.length; j > i; j--) {
var swap = str1.slice(i, j)
if (str2.indexOf(swap) != -1) {
var len = swap.length
if (len > count) {
count = len
}
break
}
}
}
return count
}
console.log(MaxCommonStr(str1, str2))