二刷64

Author: diguage

docs/0064-minimum-path-sum.adoc

@@ -44,10 +44,33 @@ Given a _m_ x _n_ grid filled with non-negative numbers, find a path from top le
 *Explanation:* Because the path 1→3→1→1→1 minimizes the sum.
 ----
 
+== 思路分析
 
 [[src-0064]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0064_MinimumPathSum.java[tag=answer]
 ----
+--
+
+二刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0064_MinimumPathSum_2.java[tag=answer]
+----
+--
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/minimum-path-sum/solutions/342122/zui-xiao-lu-jing-he-by-leetcode-solution/?envType=study-plan-v2&envId=selected-coding-interview[64. 最小路径和 - 官方题解^]
+. https://leetcode.cn/problems/minimum-path-sum/solutions/25943/zui-xiao-lu-jing-he-dong-tai-gui-hua-gui-fan-liu-c/?envType=study-plan-v2&envId=selected-coding-interview[64. 最小路径和 - 动态规划，规范流程，清晰图解^]
+
 

logbook/202406.adoc

@@ -645,6 +645,11 @@
 |{doc_base_url}/0101-symmetric-tree.adoc[题解]
 |⭕️分治
 
+|{counter:codes}
+|{leetcode_base_url}/minimum-path-sum/[64. Minimum Path Sum^]
+|{doc_base_url}/0064-minimum-path-sum.adoc[题解]
+|✅动态规划
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

src/main/java/com/diguage/algo/leetcode/_0064_MinimumPathSum.java

@@ -12,10 +12,13 @@
  * @since 2020-01-27 21:29
  */
 public class _0064_MinimumPathSum {
-  // tag::answer[]
+    // tag::answer[]
     /**
      * Runtime: 7 ms, faster than 5.53% of Java online submissions for Minimum Path Sum.
      * Memory Usage: 43.5 MB, less than 33.78% of Java online submissions for Minimum Path Sum.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-27 21:29
      */
     public int minPathSum(int[][] grid) {
         if (Objects.isNull(grid) || grid.length == 0) {

src/main/java/com/diguage/algo/leetcode/_0064_MinimumPathSum_2.java

@@ -0,0 +1,28 @@
+package com.diguage.algo.leetcode;
+
+public class _0064_MinimumPathSum_2 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2020-01-27 21:29
+   */
+  public int minPathSum(int[][] grid) {
+    int[][] dp = new int[grid.length][grid[0].length];
+    dp[0][0] = grid[0][0];
+    for (int i = 1; i < grid[0].length; i++) {
+      dp[0][i] = grid[0][i] + dp[0][i - 1];
+    }
+    for (int i = 1; i < grid.length; i++) {
+      dp[i][0] = grid[i][0] + dp[i - 1][0];
+    }
+    for (int row = 1; row < grid.length; row++) {
+      for (int column = 1; column < grid[0].length; column++) {
+        dp[row][column] = Math.min(dp[row - 1][column], dp[row][column - 1])
+          + grid[row][column];
+      }
+    }
+    return dp[grid.length - 1][grid[0].length - 1];
+  }
+  // end::answer[]
+}