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

最新推荐文章于 2023-12-06 12:00:13 发布

努利！奋斗！

最新推荐文章于 2023-12-06 12:00:13 发布

阅读量67

点赞数

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

本文链接：https://blog.csdn.net/qq_37821701/article/details/125592460

版权

Leetcode 动态规划专栏收录该内容

71 篇文章 1 订阅

订阅专栏

题目

在这里插入图片描述

解法：动态规划

非常直观的动态规划

class Solution:
    def minFallingPathSum(self, matrix: List[List[int]]) -> int:
        m,n = len(matrix),len(matrix[0])
        dp = [[float('inf')]*n for _ in range(m)]
        dp[0] = matrix[0]
        for i in range(1,m):
            for j in range(n):
                left = dp[i-1][j-1] if j > 0 else float('inf')
                above = dp[i-1][j]
                right = dp[i-1][j+1] if j < m-1 else float('inf')
                dp[i][j] = min(left,above,right) + matrix[i][j]
        
        # print(dp)
        return min(dp[-1])

解法2:加了空间压缩

class Solution:
    def minFallingPathSum(self, matrix: List[List[int]]) -> int:
        m,n = len(matrix),len(matrix[0])
        prev_row_min = matrix[0]
        for i in range(1,m):
            # print(prev_row_min)
            curr_row_min = [float('inf')]*n
            for j in range(n):
                left = prev_row_min[j-1] if j > 0 else float('inf')
                above = prev_row_min[j]
                right = prev_row_min[j+1] if j < m-1 else float('inf')
                curr_row_min[j] = min(left,above,right) + matrix[i][j]
            prev_row_min = curr_row_min
        
        return min(prev_row_min)