寻找两个字符串中最长相同子串
如:abcdefass5677 , saabcdesfabcdef34
x↓ y↓
内层循环每次从 abcdefass5677
function getCommonStr (s1, s2){
//首先判断较短字符串 var min = (s1.length > s2.length) ? s2 : s1; var max = (s2 == min) ? s1 : s2; for (var i=0; i<min.length; i++){
//每次的循环从min字符串的0号索引位置开始 for(var x=0, y=min.length-i; y!=min.length+1; x++,y++){ var newStr = min.substring(x,y); if(max.indexOf(newStr) != -1){ return newStr; } } } } console.log(getCommonStr("abcdefass5677", "saabcdesfabcdef34"));
原文:https://www.cnblogs.com/lfuxcjk/p/13096621.html