LeetCode | 64. Minimum Path Sum

最新推荐文章于 2024-09-15 15:43:59 发布

1LOVESJohnny

最新推荐文章于 2024-09-15 15:43:59 发布

阅读量96

点赞数

分类专栏： LeetCode 文章标签： LeetCode leetcode

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/101797525

版权

LeetCode 专栏收录该内容

285 篇文章 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.

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.

代码：

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
		int n = m > 0 ? grid[0].size() : 0;
		if(!m && !n)
			return 0;
		vector<vector<int>> dp(m+1, vector<int>(n+1));
		dp[0][0] = grid[0][0];
		for(int i = 1; i<m; i++)
			dp[i][0] = dp[i-1][0] + grid[i][0];
		for(int i = 1; i<n; i++)
			dp[0][i] = dp[0][i-1] + grid[0][i];
		for(int i = 1; i<m; i++)
		{
			for(int j = 1; j<n; j++)
			{
				dp[i][j] = grid[i][j] + min(dp[i-1][j], dp[i][j-1]);
			}
		}
		return dp[m-1][n-1];
    }
};