JavaScript Custom Function Implementation method to find the longest common substring of two strings _javascript tips

The example in this article describes the method that JavaScript custom function implements to find the longest common substring of two strings. Share to everyone for your reference, specific as follows:

Finds the longest common substring of two strings
function Findsubstr (s1,s2) {
  var s=sstr= "", L1=s1.length,l2=s2.length;
  if (L1>L2) {var s3=s1;s1=s2,s2=s3,l1=s2.length;}
  for (var j=l1;j> 0; j--) for
    (var i= 0; i<=l1-j;i++) {
      sstr = s1.substr (i,j);
      if (S2.indexof (SSTR) >= 0) return sstr;
    }
  Return "";
}
Document. Writeln (Findsubstr ("aaa3333", "baa333cc")); aa333
document. Writeln (Findsubstr ("aaax3333--", "baa333ccx3333333x"));//x3333

More readers interested in JavaScript-related content can view this site: "JavaScript in the JSON Operation tips Summary", "JavaScript switching effects and techniques summary", "JavaScript Search Algorithm Skills summary", " JavaScript animation effects and tips Summary, "JavaScript Error and debugging skills Summary", "JavaScript data structure and algorithm skills summary", "JavaScript traversal algorithm and Skills summary" and "JavaScript Mathematical operation Usage Summary"

I hope this article will help you with JavaScript programming.