Update 1143-longest-common-subsequence.js

Author: everthis

1143-longest-common-subsequence.js

@@ -27,18 +27,17 @@ const longestCommonSubsequence = function(text1, text2) {
   const len1 = text1.length
   const len2 = text2.length
   if(len1 === 0 || len2 === 0) return 0
-  if(len1 < len2) return longestCommonSubsequence(text2, text1)
-  const dp = Array(len1 + 1).fill(0)
-  for(let i = 1; i <= len2; i++) {
+  const dp = Array(len2 + 1).fill(0)
+  for(let i = 1; i <= len1; i++) {
     let prev = 0
-    for(let j = 1; j <= len1; j++) {
+    for(let j = 1; j <= len2; j++) {
       const tmp = dp[j]
-      if(text1[j - 1] === text2[i - 1]) dp[j] = Math.max(dp[j], prev + 1)
+      if(text1[i - 1] === text2[j - 1]) dp[j] = Math.max(dp[j], prev + 1)
       else {
         dp[j] = Math.max(dp[j - 1], dp[j])
       }
       prev = tmp
     }
   }
-  return dp[len1]
+  return dp[len2]
 };