Question

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

Answer 1

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 
    
*/

 

70+ SQL courses for beginners and professionals