64. Minimum Path Sum
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.
思路:对第一行第一列单独处理。后面的dp遍历,f[i][j]=min(f[i-1][j],f[i][j-1])+grid[i,j]。
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m=grid.size();
int n=grid[0].size();
if(m==0||n==0)
return 0;
vector<vector<int>> dp(m,vector<int>(n,0));
//处理第一行
int sum=0;
for(int i=0;i<n;i++)
{
sum+=grid[0][i];
dp[0][i]=sum;
}
sum=0;
for(int j=0;j<m;j++)
{
sum+=grid[j][0];
dp[j][0]=sum;
}
//dp遍历
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];
}
};