【Leetcode】1289. Minimum Falling Path Sum II

题目地址：

https://leetcode.com/problems/minimum-falling-path-sum-ii/description/

给定一个$n^2$矩阵$g$，求数值总和最小的下降路径的总和，要求每一步下降都不能是竖直的下降。

思路是动态规划。设$f[i][j]$是以$g[i][j]$结尾的所有路径中总和最小的路径的总和，那么： f [ i ] [ j ] = min ⁡ { f [ i − 1 ] [ j ′ ] : j ′ ≠ j } + g [ i ] [ j ] f[i][j]=\min\{f[i-1][j']:j'\ne j\}+g[i][j] f[i][j]=min{f[i−1][j′]:j′=j}+g[i][j]我们只需要求$\forall j^{\prime },f[i-1][j^{\prime }]$的最小值和次小值即可。代码如下：

class Solution {
 public:
  int minFallingPathSum(vector<vector<int>>& g) {
    int n = g.size();
    int f[n][n];
    memset(f, 0, sizeof f);
    for (int i = 0; i < n; i++) f[0][i] = g[0][i];
    for (int i = 1; i < n; i++) {
      int m1 = 2e9, m2 = 2e9;
      for (int j = 0; j < n; j++)
        if (f[i - 1][j] <= m1)
          m2 = m1, m1 = f[i - 1][j];
        else if (f[i - 1][j] < m2)
          m2 = f[i - 1][j];

      for (int j = 0; j < n; j++)
        if (f[i - 1][j] == m1)
          f[i][j] = m2 + g[i][j];
        else
          f[i][j] = m1 + g[i][j];
    }

    int res = 2e9;
    for (int i = 0; i < n; i++) res = min(res, f[n - 1][i]);
    return res;
  }
};

时空复杂度$O(n^2)$。