Longest common subsequence: Difference between revisions
Content deleted Content added
Added Oz. |
Added JavaScript |
||
Line 429:
return sb.reverse().toString();
}</lang>
=={{header|JavaScript}}==
{{trans|Java}}
This is more or less a translation of the recursive Java version above.
<lang javascript>function lcs(a, b) {
var aSub = a.substr(0, a.length-1);
var bSub = b.substr(0, b.length-1);
if (a.length == 0 || b.length == 0) {
return "";
} else if (a.charAt(a.length-1) == b.charAt(b.length-1)) {
return lcs(aSub, bSub) + a.charAt(a.length-1);
} else {
var x = lcs(a, bSub);
var y = lcs(aSub, b);
return (x.length > y.length) ? x : y;
}
}</lang>
| |||