一刷1289

Author: diguage

README.adoc

@@ -9048,14 +9048,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/1288-remove-covered-intervals.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/minimum-falling-path-sum-ii/[1289. Minimum Falling Path Sum II^]
-//|{source_base_url}/_1289_MinimumFallingPathSumII.java[Java]
-//|{doc_base_url}/1289-minimum-falling-path-sum-ii.adoc[题解]
-//|Hard
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/minimum-falling-path-sum-ii/[1289. Minimum Falling Path Sum II^]
+|{source_base_url}/_1289_MinimumFallingPathSumII.java[Java]
+|{doc_base_url}/1289-minimum-falling-path-sum-ii.adoc[题解]
+|Hard
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/convert-binary-number-in-a-linked-list-to-integer/[1290. Convert Binary Number in a Linked List to Integer^]
 //|{source_base_url}/_1290_ConvertBinaryNumberInALinkedListToInteger.java[Java]

docs/1289-minimum-falling-path-sum-ii.adoc

@@ -1,40 +1,67 @@
 [#1289-minimum-falling-path-sum-ii]
-= 1289. Minimum Falling Path Sum II
+= 1289. 下降路径最小和  II
 
-{leetcode}/problems/minimum-falling-path-sum-ii/[LeetCode - Minimum Falling Path Sum II^]
+https://leetcode.cn/problems/minimum-falling-path-sum-ii/[LeetCode - 1289. 下降路径最小和  II ^]
 
-Given a square grid of integers `arr`, a _falling path with non-zero shifts_ is a choice of exactly one element from each row of `arr`, such that no two elements chosen in adjacent rows are in the same column.
+给你一个 `n x n` 整数矩阵 `grid` ，请你返回 *非零偏移下降路径* 数字和的最小值。
 
-Return the minimum sum of a falling path with non-zero shifts.
+*非零偏移下降路径* 定义为：从 `grid` 数组中的每一行选择一个数字，且按顺序选出来的数字中，相邻数字不在原数组的同一列。
 
- 
-*Example 1:*
+*示例 1：*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* arr = [[1,2,3],[4,5,6],[7,8,9]]
-*Output:* 13
-*Explanation:*
-The possible falling paths are:
+image::images/1289-01.jpg[{image_attr}]
+
+....
+输入：grid = [[1,2,3],[4,5,6],[7,8,9]]
+输出：13
+解释：
+所有非零偏移下降路径包括：
 [1,5,9], [1,5,7], [1,6,7], [1,6,8],
 [2,4,8], [2,4,9], [2,6,7], [2,6,8],
 [3,4,8], [3,4,9], [3,5,7], [3,5,9]
-The falling path with the smallest sum is [1,5,7], so the answer is 13.
-----
+下降路径中数字和最小的是 [1,5,7] ，所以答案是 13 。
+....
+
+*示例 2：*
 
- 
-*Constraints:*
+....
+输入：grid = [[7]]
+输出：7
+....
 
+*提示：*
 
-* `1 <= arr.length == arr[i].length <= 200`
-* `-99 <= arr[i][j] <= 99`
+* `n == grid.length == grid[i].length`
+* `+1 <= n <= 200+`
+* `+-99 <= grid[i][j] <= 99+`
 
 
+== 思路分析
 
 
 [[src-1289]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
-include::{sourcedir}/_1289_MinimumFallingPathSumII.java[tag=answer]
+include::{sourcedir}/_1289_MinimumFallingPathSumIi.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_1289_MinimumFallingPathSumIi_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
+
 

docs/images/1289-01.jpg

@@ -2660,7 +2660,7 @@ include::1253-reconstruct-a-2-row-binary-matrix.adoc[leveloffset=+1]
 
 // include::1288-remove-covered-intervals.adoc[leveloffset=+1]
 
-// include::1289-minimum-falling-path-sum-ii.adoc[leveloffset=+1]
+include::1289-minimum-falling-path-sum-ii.adoc[leveloffset=+1]
 
 // include::1290-convert-binary-number-in-a-linked-list-to-integer.adoc[leveloffset=+1]
 

docs/index.adoc

@@ -330,6 +330,12 @@ endif::[]
 |{doc_base_url}/0931-minimum-falling-path-sum.adoc[题解]
 |✅ 动态规划
 
+|{counter:codes2503}
+|{leetcode_base_url}/minimum-falling-path-sum-ii/[1289. 下降路径最小和  II^]
+|{doc_base_url}/1289-minimum-falling-path-sum-ii.adoc[题解]
+|⭕️ 动态规划。题目理解错误。
+
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

logbook/202503.adoc

@@ -0,0 +1,42 @@
+package com.diguage.algo.leetcode;
+
+public class _1289_MinimumFallingPathSumIi {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-04-18 22:56:34
+   */
+  public int minFallingPathSum(int[][] grid) {
+    int len = grid.length;
+    if (len == 1) {
+      return grid[0][0];
+    }
+    int result = Integer.MAX_VALUE;
+    for (int r = 1; r < len; r++) {
+      for (int c = 0; c < len; c++) {
+        int min = Integer.MAX_VALUE;
+        for (int i = 0; i < len; i++) {
+          if (i == c) {
+            continue;
+          }
+          min = Math.min(min, grid[r - 1][i]);
+        }
+        grid[r][c] += min;
+        if (r == len - 1) {
+          result = Math.min(result, grid[r][c]);
+        }
+      }
+    }
+    return result;
+  }
+  // end::answer[]
+
+  public static void main(String[] args) {
+    new _1289_MinimumFallingPathSumIi().minFallingPathSum(new int[][]{
+      {-73, 61, 43, -48, -36},
+      {3, 30, 27, 57, 10},
+      {96, -76, 84, 59, -15},
+      {5, -49, 76, 31, -7},
+      {97, 91, 61, -46, 67}});
+  }
+}