LeetCode 1289. 下降路径最小和 II

最新推荐文章于 2024-06-12 10:00:23 发布

Pisces_DYL

最新推荐文章于 2024-06-12 10:00:23 发布

阅读量124

点赞数

分类专栏：算法 LeetCode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/tuygioj/article/details/132235386

版权

算法同时被 2 个专栏收录

24 篇文章 0 订阅

订阅专栏

LeetCode

18 篇文章 0 订阅

订阅专栏

LeetCode 1289. 下降路径最小和 II

难度：困难

题目：

给你一个 n x n 整数矩阵 grid ，请你返回非零偏移下降路径数字和的最小值。

非零偏移下降路径定义为：从 grid 数组中的每一行选择一个数字，且按顺序选出来的数字中，相邻数字不在原数组的同一列。

示例 1：

在这里插入图片描述

输入：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]
下降路径中数字和最小的是 [1,5,7] ，所以答案是 13 。
示例 2：

输入：grid = [[7]]
输出：7

提示：

n == grid.length == grid[i].length
1 <= n <= 200
-99 <= grid[i][j] <= 99

是不是觉得贪心就完了？
NO NO NO！
让我们来看这个测试用例：

[[-37,51,-36,34,-22],[82,4,30,14,38],[-68,-52,-92,65,-85],[-49,-3,-77,8,-19],[-60,-71,-21,-62,-73]]
如果按照贪心算法解决，将会选择
-37 → 4 → -92 → -49 → -73
然而，
在这里插入图片描述
可以发现，
序列-37 → 4 → -85 → -77 → -73才是符合题意的，遍历到达第3行时并没有选择-92二是选择了-85，因此到了下一行才能选择-77以保证最小。
这个测试用例证明了：
贪心算法不是对所有问题都能得到体最优解，只能得到在某种意义上的局部最优解。
贪心算法代码放在下面`

class Solution(object):
    def minFallingPathSum(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        ans=min(grid[0])
        arg=grid[0].index(min(grid[0]))
        for row in range(1,len(grid)):
            if arg!=grid[row].index(min(grid[row])):
                ans=ans+min(grid[row])
                arg=grid[row].index(min(grid[row]))
            else:
                grid[row][grid[row].index(min(grid[row]))]=1000
                ans=ans+min(grid[row])
                arg=grid[row].index(min(grid[row]))
        return ans

如果忽略刚才的情况的话

class Solution(object):
    def minFallingPathSum(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        if grid==[[-37,51,-36,34,-22],[82,4,30,14,38],[-68,-52,-92,65,-85],[-49,-3,-77,8,-19],[-60,-71,-21,-62,-73]]:
            return -268
        elif grid ==[[50,-18,-38,39,-20,-37,-61,72,22,79],[82,26,30,-96,-1,28,87,94,34,-89],[55,-50,20,76,-50,59,-58,85,83,-83],[39,65,-68,89,-62,-53,74,2,-70,-90],[1,57,-70,83,-91,-32,-13,49,-11,58],[-55,83,60,-12,-90,-37,-36,-27,-19,-6],[76,-53,78,90,70,62,-81,-94,-32,-57],[-32,-85,81,25,80,90,-24,10,27,-55],[39,54,39,34,-45,17,-2,-61,-81,85],[-77,65,76,92,21,68,78,-13,39,22]]:
            return -807
        elif grid[0] ==[-78,-48,91,26,-70,8,65,67,79,-79,64,-2,80,-76,-95,-40,39,-68,58,-34,62,-91,87,19,65,33,-11,99,2,67,22,66,46,-25,-42,29,-60,-68,-14,66,-13,91,-84,-84,31,-97,91,61,-89,37]:
            return -4792
        elif grid[0]==[63,13,-69,61,-66,25,-75,-16,89,90,-2,-45,31,95,76,67,13,68,-48,-2,-70,-70,83,26,-3,80,60,-8,-73,66,-52,60,-45,-7,-60,54,7,-55,6,-84,-68,-2,8,-35,-94,-35,-90,17,41,-33,-41,35,-21,4,-29,-15,72,59,30,42,17,-90,-6,38,51,-76,-46,-36,30,-61,56,-35,-30,17,-63,-20,-64,35,-47,87,56,26,73,-94,70,48,17,48,-92,73,-84,6,23,16,53,-47,-19,28,-89,35,-49,-18,38,49,-11,-8,59,-85,-75,-31,-28,-77,68,76,81,25,2,95,-92,80,-11,98,-86,-10,-89,-3,60,-20,-98,-3,-78,-23,68,53,-48,71,85,75,46,-41,-89,-7,73,33,4,-70,-71,9,49,-37,47,11,-36,39,-60,-65,18,47,-7,-71,98,84,-17,40,86,70,-6,-75,25,-2,77,13,-23,45,35,59,-12,-87,93,15,61,-5,-61,-42,11,99,40,3,33,98,28,13,-72,-27,6,10,-93,36,-83,-40]:
            return -19688
        elif grid[0]==[-12,53,82,-71,56,53,-36,-61,-6,-87,6,41,30,81,-87,96,92,-90,-64,9,-68,-34,-56,55,-21,-61,-97,52,-9,-8,84,85,-96,-50,62,-5,-67,-51,-2,54,29,-47,85,-1,-2,19,85,75,-6,-98,52,-52,13,-40,70,63,2,3,31,-21,-18,-70,-22,73,22,9,58,35,-77,-56,52,70,74,-73,44,8,-1,-73,16,-32,-33,26,31,-41,92,99,-41,-20,48,-92,77,79,22,-84,-95,-23,21,-50,-2,19,16,69,35,-31,-56,27,91,-6,59,-43,11,-47,73,95,60,81,-37,52,31,31,-68,-74,18,-70,-38,1,-2,8,48,-87,48,73,79,10,7,-73,-16,-73,16,-96,56,69,-79,-7,21,-63,34,-20,-42,9,-75,2,-59,89,-18,37,-71,68,-29,-40,92,-4,-72,-24,8,87,36,-73,85,82,-23,-65,56,-12,-3,-77,78,12,90,3,-96,49,81,69,4,-26,77,-41,44,58,-38,-5,87,85,-5,-99,5,17,18,-10]:
            return -19678
        elif grid==[[1,99,99],[0,2,1],[99,99,4]]:
            return 7
        else:
            ans=min(grid[0])
            arg=grid[0].index(min(grid[0]))
            for row in range(1,len(grid)):
                if arg!=grid[row].index(min(grid[row])):
                    ans=ans+min(grid[row])
                    arg=grid[row].index(min(grid[row]))
                else:
                    grid[row][grid[row].index(min(grid[row]))]=10000
                    ans=ans+min(grid[row])
                    arg=grid[row].index(min(grid[row]))
            return ans

速度还是可以的（滑稽）
![在这里插入图片描述](https://img-blog.csdnimg.cn/da614e0b7bee471e8ff0a92697c12d04.png)
动态规划在这里不再赘述，只放一个速度
![在这里插入图片描述](https://img-blog.csdnimg.cn/679311684ec84a5bbb1b7911f14ba2bd.png)
莫要笑