Minimum Path Sum

最新推荐文章于 2021-07-23 19:32:26 发布

Godkiller123

最新推荐文章于 2021-07-23 19:32:26 发布

阅读量290

点赞数

分类专栏： LeetCode 文章标签：动态管理 leetcode

本文链接：https://blog.csdn.net/u012734829/article/details/41893827

版权

LeetCode 专栏收录该内容

90 篇文章 0 订阅

订阅专栏

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

明显的动态管理求解动态方程 res[i][j]=min(res[i-1][j],res[i][j-1])+grid[i][j] 代码如下：

public class Solution {
	public  int minPathSum(int[][] grid) {
	    if(grid.length<=0) return 0;
	    int m=grid.length;
	    int n=grid[0].length;
	    int[][] res=new int[m][n];
	    res[0][0]=grid[0][0];
	    for(int i=1;i<n;i++){
	        res[0][i]=grid[0][i]+res[0][i-1];
	    }
	    for(int i=1;i<m;i++){
	        res[i][0]=grid[i][0]+res[i-1][0];
	    }
	    for(int i=1;i<m;i++){
	        for(int j=1;j<n;j++){
	            res[i][j]=Math.min(res[i-1][j],res[i][j-1])+grid[i][j];
	        }
	    }
	    return res[m-1][n-1];
	}
}