64. Minimum Path Sum
网站:https://leetcode.com/problems/minimum-path-sum/description/
代码:
class Solution:
def minPathSum(self, grid):
row = len(grid)
cow = len(grid[0])
_list = [[0]*cow]*row
if row == 0 | cow == 0:
return 0
for i in range(row):
for j in range(cow):
if i == 0 and j == 0:
_list[0][0] = grid[0][0]
elif j == 0:
_list[i][0] = _list[i-1][0] + grid[i][0]
elif i == 0:
_list[0][j] = _list[0][j-1] + grid[0][j]
else:
_list[i][j] = min(_list[i-1][j],_list[i][j-1]) + grid[i][j]
return _list[row-1][cow-1]
题意:求出一个数组中的最短路径长度
思路:先设置一个空列表_list,然后用两层循环依次更新列表中每一个点的距离,每一次更新的时候都选择上边和左边这两个相邻点中最小的那个和当前点之和作为新的当前点的数字,最后返回列表的右下角点的数字
提交情况: