From c25a76587ec1028b0ab80607c2dcd14a15f18475 Mon Sep 17 00:00:00 2001
From: Terry Liu <102352821+Lozakaka@users.noreply.github.com>
Date: Fri, 16 Jun 2023 21:23:27 -0400
Subject: [PATCH] =?UTF-8?q?=E6=96=B0=E5=A2=9Ejava=EF=BC=9A=E7=94=A8?=
 =?UTF-8?q?=E6=9C=80=E9=95=B7=E5=85=AC=E5=85=B1=E5=AD=90=E5=BA=8F=E5=88=97?=
 =?UTF-8?q?=E5=8F=8D=E6=8E=A8?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

新增java：用最長公共子序列反推
---
 .../0583.两个字符串的删除操作.md    | 25 +++++++++++++++++++
 1 file changed, 25 insertions(+)

diff --git a/problems/0583.两个字符串的删除操作.md b/problems/0583.两个字符串的删除操作.md
index 561ad2f2..3e225e82 100644
--- a/problems/0583.两个字符串的删除操作.md
+++ b/problems/0583.两个字符串的删除操作.md
@@ -184,6 +184,31 @@ class Solution {
     }
 }
 ```
+```java
+//DP - longest common subsequence (用最長公共子序列反推)
+class Solution {
+    public int minDistance(String word1, String word2) {
+        char[] char1 = word1.toCharArray();
+        char[] char2 = word2.toCharArray();
+
+        int len1 = char1.length;
+        int len2 = char2.length;
+
+        int dp[][] = new int [len1 + 1][len2 + 1];
+
+        for(int i = 1; i <= len1; i++){
+            for(int j = 1; j <= len2; j++){
+                if(char1[i - 1] == char2[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 len1 + len2 - (2 * dp[len1][len2]);//和leetcode 1143只差在這一行。
+    }
+}
+```
 
 
 Python：