Leetcode-931. Minimum Falling Path Sum 下降路径最小和（DP）

最新推荐文章于 2024-04-22 14:00:57 发布

简米

最新推荐文章于 2024-04-22 14:00:57 发布

阅读量165

点赞数

分类专栏： Leetcode 文章标签： leetcode 动态规划 python

本文链接：https://blog.csdn.net/JamieLuo/article/details/106089447

版权

Leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

题目

给定一个方形整数数组 A，我们想要得到通过 A 的下降路径的最小和。
下降路径可以从第一行中的任何元素开始，并从每一行中选择一个元素。在下一行选择的元素和当前行所选元素最多相隔一列。
链接：https://leetcode.com/problems/minimum-falling-path-sum/

Given a square array of integers A, we want the minimum sum of a falling path through A.

A falling path starts at any element in the first row, and chooses one element from each row. The next row’s choice must be in a column that is different from the previous row’s column by at most one.

Example:

Input: [[1,2,3],[4,5,6],[7,8,9]]
Output: 12
Explanation:
The possible falling paths are:
-[1,4,7], [1,4,8], [1,5,7], [1,5,8], [1,5,9]
-[2,4,7], [2,4,8], [2,5,7], [2,5,8], [2,5,9], [2,6,8], [2,6,9]
-[3,5,7], [3,5,8], [3,5,9], [3,6,8], [3,6,9]
The falling path with the smallest sum is [1,4,7], so the answer is 12.

思路及代码

DP

s[i][j]：到达i,j时的最小和
s[i][j] = A[i][j] + min(s[i-1][j-1],s[i-1][j],s[i-1][j+1])
- 到达i,j可以从左上，上，右上三个方向，取其中最小值即可
初始值s[0][j] = A[0][j]：第一行s等于矩阵对应值
返回值min(s[m-1])：返回最后一行的最小值

# 116ms 90.57%
class Solution:
    def minFallingPathSum(self, A: List[List[int]]) -> int:
        m = len(A)
        n = len(A[0])
        s = [[0 for i in range(n)] for j in range(m)]
        for i in range(m):
            for j in range(n):
                if i == 0:
                    s[i][j] = A[i][j]
                elif j == 0:
                    s[i][j] = A[i][j] + min(s[i-1][j],s[i-1][j+1])
                elif j == n-1:
                    s[i][j] = A[i][j] + min(s[i-1][j-1],s[i-1][j])
                else:
                    s[i][j] = A[i][j] + min(s[i-1][j-1],s[i-1][j],s[i-1][j+1])
        return min(s[m-1])