From b1407c02a48f53dde729dea361c41ab283e72fb1 Mon Sep 17 00:00:00 2001 From: Yang Date: Mon, 14 Jun 2021 22:09:33 -0400 Subject: [PATCH] =?UTF-8?q?Update=200583.=E4=B8=A4=E4=B8=AA=E5=AD=97?= =?UTF-8?q?=E7=AC=A6=E4=B8=B2=E7=9A=84=E5=88=A0=E9=99=A4=E6=93=8D=E4=BD=9C?= =?UTF-8?q?.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Add Java solution --- .../0583.两个字符串的删除操作.md | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/problems/0583.两个字符串的删除操作.md b/problems/0583.两个字符串的删除操作.md index 0b32d129..ee1fbc5f 100644 --- a/problems/0583.两个字符串的删除操作.md +++ b/problems/0583.两个字符串的删除操作.md @@ -104,6 +104,28 @@ public: Java： +```java +class Solution { + public int minDistance(String word1, String word2) { + int[][] dp = new int[word1.length() + 1][word2.length() + 1]; + for (int i = 0; i < word1.length() + 1; i++) dp[i][0] = i; + for (int j = 0; j < word2.length() + 1; j++) dp[0][j] = j; + + for (int i = 1; i < word1.length() + 1; i++) { + for (int j = 1; j < word2.length() + 1; j++) { + if (word1.charAt(i - 1) == word2.charAt(j - 1)) { + dp[i][j] = dp[i - 1][j - 1]; + }else{ + dp[i][j] = Math.min(dp[i - 1][j - 1] + 2, + Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1)); + } + } + } + + return dp[word1.length()][word2.length()]; + } +} +``` Python：