Leetcde-931. Minimum Falling Path Sum

最新推荐文章于 2022-08-26 00:33:12 发布

原创最新推荐文章于 2022-08-26 00:33:12 发布 · 198 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode

Leetcode 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种解决LeetCode上最小下降路径和问题的方法。通过遍历矩阵，从第二行开始，对于每一行的每个元素，寻找上方两到三个元素中的最小值并累加。边界条件特别考虑了最左侧和最右侧的元素只能搜索两个元素的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Original link: https://leetcode.com/problems/minimum-falling-path-sum/

For elements in the second line and below, we can search the upper two or three elements and add the minimum value.
Boundary condition: elements in the most left and the most right. They can only search for two elements.

Code:

class Solution(object):
    def minFallingPathSum(self, A):
        """
        :type A: List[List[int]]
        :rtype: int
        """
        
        for r in range(1, len(A)):
            
            A[r][0] += min(A[r-1][0], A[r-1][1])
            
            for c in range(1, len(A[r]) - 1):
                
                A[r][c] += min(A[r-1][c-1:c+2])

            A[r][-1] += min(A[r-1][-2], A[r-1][-1])
        
        return min(A[-1])