64. Minimum Path Sum

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

是三水不是泗水

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

阅读量99

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/csg3140100993/article/details/102980647

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

64. Minimum Path Sum

Medium

175445FavoriteShare

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.

Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

Accepted

275,981

Submissions

559,273

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m=grid.size();
        int n=grid[0].size();
        int dp[m][n]={};
        dp[0][0]=grid[0][0];
        for(int i=1;i<n;i++){//0行n列
        	dp[0][i]=dp[0][i-1]+grid[0][i];
        }
        for(int i=1;i<m;i++){//0列n行
        	dp[i][0]=dp[i-1][0]+grid[i][0];
        }
        for(int i=1;i<m;i++){//除了第一行和第一列之外的部分
        	for(int j=1;j<n;j++){
        		dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j];
        	}
        }
        return dp[m-1][n-1];
    }
};