From d5392f4936b412e0b288d5170254b3f6aa12f15e Mon Sep 17 00:00:00 2001
From: wang2jun <91008685+wang2jun@users.noreply.github.com>
Date: Tue, 8 Nov 2022 15:01:42 +0800
Subject: [PATCH] =?UTF-8?q?=E5=A2=9E=E5=8A=A0=200583=20=E4=B8=A4=E4=B8=AA?=
 =?UTF-8?q?=E5=AD=97=E7=AC=A6=E4=B8=B2=E7=9A=84=E5=88=A0=E9=99=A4=E6=93=8D?=
 =?UTF-8?q?=E4=BD=9C=20Javascript=20=E6=96=B9=E6=B3=95=E4=BA=8C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

增加 0583 两个字符串的删除操作 Javascript 方法二
---
 .../0583.两个字符串的删除操作.md    | 55 ++++++++++++-------
 1 file changed, 35 insertions(+), 20 deletions(-)

diff --git a/problems/0583.两个字符串的删除操作.md b/problems/0583.两个字符串的删除操作.md
index 6bc50421..ca3c118f 100644
--- a/problems/0583.两个字符串的删除操作.md
+++ b/problems/0583.两个字符串的删除操作.md
@@ -228,28 +228,43 @@ func min(a, b int) int {
 ```
 Javascript：
 ```javascript
-const minDistance = (word1, word2) => {
-    let dp = Array.from(new Array(word1.length + 1), () => Array(word2.length+1).fill(0));
-
-    for(let i = 1; i <= word1.length; i++) {
-        dp[i][0] = i; 
+// 方法一
+var minDistance = (word1, word2) => {
+  let dp = Array.from(new Array(word1.length + 1), () =>
+    Array(word2.length + 1).fill(0)
+  );
+  for (let i = 1; i <= word1.length; i++) {
+    dp[i][0] = i;
+  }
+  for (let j = 1; j <= word2.length; j++) {
+    dp[0][j] = j;
+  }
+  for (let i = 1; i <= word1.length; i++) {
+    for (let j = 1; j <= word2.length; j++) {
+      if (word1[i - 1] === word2[j - 1]) {
+        dp[i][j] = dp[i - 1][j - 1];
+      } else {
+        dp[i][j] = Math.min(
+          dp[i - 1][j] + 1,
+          dp[i][j - 1] + 1,
+          dp[i - 1][j - 1] + 2
+        );
+      }
     }
+  }
+  return dp[word1.length][word2.length];
+};
 
-    for(let j = 1; j <= word2.length; j++) {
-        dp[0][j] = j;
-    }
-
-    for(let i = 1; i <= word1.length; i++) {
-        for(let j = 1; j <= word2.length; j++) {
-            if(word1[i-1] === word2[j-1]) {
-                dp[i][j] = dp[i-1][j-1];
-            } else {
-                dp[i][j] = Math.min(dp[i-1][j] + 1, dp[i][j-1] + 1, dp[i-1][j-1] + 2);
-            }
-        }
-    }
-    
-    return dp[word1.length][word2.length];
+// 方法二
+var minDistance = function (word1, word2) {
+  let dp = new Array(word1.length + 1)
+    .fill(0)
+    .map((_) => new Array(word2.length + 1).fill(0));
+  for (let i = 1; i <= word1.length; i++)
+    for (let j = 1; j <= word2.length; j++)
+      if (word1[i - 1] === word2[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
+      else dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+  return word1.length + word2.length - dp[word1.length][word2.length] * 2;
 };
 ```