Welcome to collectivesolver - Programming & Software Q&A. A website you can trust. All programs tested and works. Contact: aviboots(AT)netvision.net.il
Bonsai Boy of New York Bonsai Trees and Accessories

BlueHost Web Hosting

Liquid Web Managed Dedicated Server: RAID 1 SSD with 16GB of RAM minimum! 24/7 On-Site Heroic Support! Industry-Leading SLA!

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

getflywheel wordpress hosting


Liquid Web Cloud VPS Hosting

10,484 questions

14,262 answers

573 users

How to find the length of longest common subsequence (LCS) present in two strings with JavaScript

1 Answer

0 votes
function mymax(a, b) {
    return (a > b) ? a : b;
}
  
function lcs(s1, s2, s1_len, s2_len) {
    if (s1_len == 0 || s2_len == 0) {
        return 0;
    }
    if (s1[s1_len - 1] == s2[s2_len - 1]) {
        return 1 + lcs(s1, s2, s1_len - 1, s2_len - 1);
    }
    else {
        return mymax(lcs(s1, s2, s1_len, s2_len - 1), lcs(s1, s2, s1_len - 1, s2_len));
    }
}
   
   
var s1 = "accyrb";
var s2 = "cyxyazb";
 
document.write("The length of LCS is: " + lcs(s1, s2, s1.length, s2.length));


/*
run:
    
The length of LCS is: 3 
    
*/

 




answered Jun 7 by avibootz
...