题目描述
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.
Hide Tags Array Dynamic Programming
分析:又是格子路径问题,可参考同类题型http://blog.csdn.net/bu_min/article/details/45565941
和http://blog.csdn.net/bu_min/article/details/45566501
本题要求从最左上格子到最右下格子的最小路径和,并且只能向下和向右前进。
类似的,动态规划思路:从左上角开始,依次计算每个格子的最小路径和,最后就能得到最右下方的最短路径和。
前提:此处的最短路径都是从最上方的格子出发。
以下是C++实现代码:
/*/32ms/*/
class Solution {
public:
int min(int a,int b)
{
return a < b ? a:b;
}
int minPathSum(vector<vector<int>>& grid)
{
if(grid.empty())
return 0;
int m = grid.size();
int n = grid[0].size();
vector<vector<int>> dp(m,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 j = 1; j != n; j++)
{
dp[0][j] = dp[0][j-1] + grid[0][j];
}
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];
}
};