DESC:
给定一个包含非负整数的 m x n 网格 grid ,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
说明:每次只能向下或者向右移动一步。
示例 1:
输入:grid = [[1,3,1],[1,5,1],[4,2,1]]
输出:7
解释:因为路径 1→3→1→1→1 的总和最小。示例 2:
输入:grid = [[1,2,3],[4,5,6]]
输出:12提示:
m == grid.length
n == grid[i].length
1 <= m, n <= 200
0 <= grid[i][j] <= 100来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/minimum-path-sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
CODE:
JAVA:
import java.util.*; public class Solution { /** * * @param matrix int整型二维数组 the matrix * @return int整型 */ public int minPathSum (int[][] matrix) { // write code here if (matrix == null) { return 0; } int n = matrix.length; int m = matrix[0].length; int[][] dp = new int[n][m]; dp[0][0] = matrix[0][0]; for (int i=1; i<n; i++) { dp[i][0] = matrix[i][0] + dp[i-1][0]; } for (int j=1; j<m; j++) { dp[0][j] = matrix[0][j] + dp[0][j-1]; } for (int i=1; i < n; i++) { for (int j=1; j < m;j++) { dp[i][j] = matrix[i][j] + Math.min(dp[i][j-1], dp[i-1][j]); } } return dp[n-1][m-1]; } }
Python
class Solution: def minPathSum(self, grid: List[List[int]]) -> int: if not grid or len(grid)==0: return 0 m = len(grid) n = len(grid[0]) if n==0: return 0 dp = [[0]*n for i in range(m)] dp[0][0] = grid[0][0] for i in range(1, m): dp[i][0] = dp[i-1][0]+grid[i][0] for j in range(1, n): dp[0][j] = dp[0][j-1]+ grid[0][j] for i in range(m): for j in range(n): if i==0 or j==0: continue dp[i][j] = min(dp[i-1][j], dp[i][j-1])+grid[i][j] return dp[m-1][n-1]
NOTES:
- 类似字符串编辑距离,使用动态规划,d(i,j)=v(i,j) + min(d(i,j-1), d(i-1,j)),d(0,0)=v(0,0)
- i=0即第一行,d(0,j) = v(0,j) + d(0,j-1)从左往右累加
- j=0即第一列,d(i,0)= v(i,0)+d(i-1,0)从上往下累加