一刷72

Author: diguage

README.adoc

@@ -530,12 +530,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 |Medium
 |
 
-//|{counter:codes}
-//|{leetcode_base_url}/edit-distance/[72. Edit Distance^]
-//|{source_base_url}/_0072_EditDistance.java[Java]
-//|{doc_base_url}/0072-edit-distance.adoc[题解]
-//|Hard
-//|
+|{counter:codes}
+|{leetcode_base_url}/edit-distance/[72. Edit Distance^]
+|{source_base_url}/_0072_EditDistance.java[Java]
+|{doc_base_url}/0072-edit-distance.adoc[题解]
+|Hard
+|
 
 |{counter:codes}
 |{leetcode_base_url}/set-matrix-zeroes/[73. Set Matrix Zeroes^]

docs/0000-00-note.adoc

@@ -259,3 +259,4 @@ image::images/quick-sort-01.gif[{image_attr}]
 . https://github.com/doocs/leetcode[doocs/leetcode: 🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解^] -- 也可以在这里找题目
 . https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews[Several Coding Patterns for Solving Data Structures and Algorithms Problems during Interviews^] -- 多种解题范式总结
 . https://leetcode.cn/problems/climbing-stairs/solutions/2560716/jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-7zm1/?envType=study-plan-v2&envId=selected-coding-interview[70. 爬楼梯 - 教你一步步思考动态规划：从记忆化搜索到递推^]
+. https://leetcode.cn/circle/discuss/xV68NV/[不同层次的面试算法学习规划^]

docs/0072-edit-distance.adoc

@@ -1,49 +1,95 @@
 [#0072-edit-distance]
-= 72. Edit Distance
+= 72. 编辑距离
 
-{leetcode}/problems/edit-distance/[LeetCode - Edit Distance^]
+https://leetcode.cn/problems/edit-distance/[LeetCode - 72. 编辑距离 ^]
 
-Given two words _word1_ and _word2_, find the minimum number of operations required to convert _word1_ to _word2_.
+给你两个单词 `+word1+` 和 `+word2+`，
+_请返回将 `+word1+` 转换成 `+word2+` 所使用的最少操作数_ 。
 
-You have the following 3 operations permitted on a word:
+你可以对一个单词进行如下三种操作：
 
+* 插入一个字符
+* 删除一个字符
+* 替换一个字符
 
-. Insert a character
-. Delete a character
-. Replace a character
 
 
-*Example 1:*
+*示例1：*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* word1 = "horse", word2 = "ros"
-*Output:* 3
-*Explanation:* 
-horse -> rorse (replace 'h' with 'r')
-rorse -> rose (remove 'r')
-rose -> ros (remove 'e')
-----
+....
+输入：word1 = "horse", word2 = "ros"
+输出：3
+解释：
+horse -> rorse (将 'h' 替换为 'r')
+rorse -> rose (删除 'r')
+rose -> ros (删除 'e')
+....
 
-*Example 2:*
+*示例2：*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* word1 = "intention", word2 = "execution"
-*Output:* 5
-*Explanation:* 
-intention -> inention (remove 't')
-inention -> enention (replace 'i' with 'e')
-enention -> exention (replace 'n' with 'x')
-exention -> exection (replace 'n' with 'c')
-exection -> execution (insert 'u')
-----
+....
+输入：word1 = "intention", word2 = "execution"
+输出：5
+解释：
+intention -> inention (删除 't')
+inention -> enention (将 'i' 替换为 'e')
+enention -> exention (将 'n' 替换为 'x')
+exention -> exection (将 'n' 替换为 'c')
+exection -> execution (插入 'u')
+....
+
+*提示：*
+
+* `+0 <= word1.length, word2.length <= 500+`
+* `+word1+` 和 `+word2+` 由小写英文字母组成
+
+
+== 思路分析
+
+动态规划
+
+`dp[i][j]` 代表 `word1` 中前 `i` 个字符，变换到 `word2` 中前 `j` 个字符，最短需要操作的次数。
 
+image::images/0072-01.png[{image_attr}]
 
+image::images/0072-02.png[{image_attr}]
+
+image::images/0072-03.png[{image_attr}]
+
+image::images/0072-04.png[{image_attr}]
+
+image::images/0072-05.png[{image_attr}]
+
+image::images/0072-06.png[{image_attr}]
+
+image::images/0072-07.png[{image_attr}]
 
 [[src-0072]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0072_EditDistance.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0072_EditDistance_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
+
+. https://leetcode.cn/problems/edit-distance/solutions/189676/edit-distance-by-ikaruga/[72. 编辑距离 - 【编辑距离】入门动态规划，你定义的 dp 里到底存了啥^]
+. https://leetcode.cn/problems/edit-distance/solutions/188223/bian-ji-ju-chi-by-leetcode-solution/[72. 编辑距离 - 官方题解^]
+
 

docs/images/0072-01.png

@@ -218,7 +218,7 @@ include::0070-climbing-stairs.adoc[leveloffset=+1]
 
 include::0071-simplify-path.adoc[leveloffset=+1]
 
-// include::0072-edit-distance.adoc[leveloffset=+1]
+include::0072-edit-distance.adoc[leveloffset=+1]
 
 include::0073-set-matrix-zeroes.adoc[leveloffset=+1]
 

docs/images/0072-02.png

@@ -909,6 +909,11 @@
 |{doc_base_url}/0881-boats-to-save-people.adoc[题解]
 |❌ 贪心+双指针
 
+|{counter:codes}
+|{leetcode_base_url}/edit-distance/[72. Edit Distance^]
+|{doc_base_url}/0072-edit-distance.adoc[题解]
+|❌ 动态规划，看答案秒懂，自己想不出来！
+
 
 |===
 

docs/images/0072-03.png

@@ -13,10 +13,13 @@
  * @since 2020-02-04 16:15
  */
 public class _0071_SimplifyPath {
-  // tag::answer[]
+    // tag::answer[]
     /**
      * Runtime: 5 ms, faster than 71.14% of Java online submissions for Simplify Path.
      * Memory Usage: 39.9 MB, less than 6.67% of Java online submissions for Simplify Path.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-02-04 16:15
      */
     public String simplifyPath(String path) {
         String[] paths = path.split("/");

docs/images/0072-04.png

@@ -0,0 +1,40 @@
+package com.diguage.algo.leetcode;
+
+public class _0072_EditDistance {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-30 17:32:45
+   */
+  public int minDistance(String word1, String word2) {
+    int len1 = word1.length();
+    int len2 = word2.length();
+    // 1. 确定 dp[i][j] 含义
+    int[][] dp = new int[len1 + 1][len2 + 1];
+    // 3. 初始化基本状态
+    for (int i = 0; i <= len1; i++) {
+      dp[i][0] = i;
+    }
+    for (int i = 0; i <= len2; i++) {
+      dp[0][i] = i;
+    }
+    // 确定遍历过程
+    for (int i = 1; i <= len1; i++) {
+      for (int j = 1; j <= len2; j++) {
+        // 2. 确定转移方程
+        if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
+          dp[i][j] = dp[i - 1][j - 1];
+        } else {
+          // 删除操作：dp[i - 1][j]
+          // 增加操作：dp[i][j - 1]
+          // 替换操作：dp[i - 1][j - 1]
+          dp[i][j] = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]),
+            dp[i - 1][j - 1]) + 1;
+        }
+      }
+    }
+    return dp[len1][len2];
+  }
+  // end::answer[]
+}