64最小路径和

Author: SimmyZhong

64_minimum-path-sum.py

@@ -0,0 +1,30 @@
+"""
+https://leetcode-cn.com/problems/minimum-path-sum/
+给定一个包含非负整数的 m x n 网格，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。
+
+说明：每次只能向下或者向右移动一步。
+
+示例:
+
+输入:
+[
+  [1,3,1],
+  [1,5,1],
+  [4,2,1]
+]
+输出: 7
+解释: 因为路径 1→3→1→1→1 的总和最小。"""
+
+
+class Solution:
+    """动态规划法"""
+    def minPathSum(self, grid):
+            for i in range(len(grid)):
+                for j in range(len(grid[0])):
+                    if i and j:
+                        grid[i][j] = min(grid[i][j-1], grid[i-1][j]) + grid[i][j]
+                    elif j:
+                        grid[i][j] = grid[i][j-1] + grid[i][j]
+                    elif i:
+                        grid[i][j] = grid[i-1][j] + grid[i][j]
+            return grid[-1][-1]

readme.md

@@ -74,4 +74,6 @@
 
   015 [最大子序和](https://github.com/SimmyZhong/leetCode/blob/master/golang/53_maximum_subarray.go)
 
+  064 [最小路径和](https://github.com/SimmyZhong/leetCode/blob/master/64_minimum-path-sum.py)
+
   120 [三角形的最小和最大路径和](https://github.com/SimmyZhong/leetCode/blob/master/120_triangle.py)