We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 78a7ea0 commit 927c786Copy full SHA for 927c786
javascript/1143-Longest-Common-Subsequence.js
@@ -7,7 +7,6 @@ var longestCommonSubsequence = function (text1, text2) {
7
for (let i = 1; i <= m; i++) {
8
for (let j = 1; j <= n; j++) {
9
if (text1.charAt(i - 1) !== text2.charAt(j - 1)) {
10
-
11
table[i][j] = Math.max(table[i - 1][j], table[i][j - 1]);
12
} else {
13
table[i][j] = table[i - 1][j - 1] + 1;
0 commit comments