一.问题描述
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.
二.我的解题思路
这道题跟之前的unique path的题没啥区别,直接用动态规划(DP)去做即可。当然,算法的递归式需要作相应他修改:m[i][j]=min(m[i-1][j],m[i][j-1])+grid[m-1][n-1];
测试通过的程序如下:
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m = grid.size();
if(m<=0) return 0;
int n =grid[0].size();
if(m==1 && n==1 ) return grid[0][0];
if( n<=0) return 0;
int res[m+1][n+1];
for(int i=0;i<=m;i++) res[i][0]=0;
for(int i=0;i<=n;i++) res[0][i]=0;
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(i!=1 && j!=1){
res[i][j]=(res[i-1][j]>res[i][j-1])? res[i][j-1]+grid[m-i][n-j] : res[i-1][j]+grid[m-i][n-j];
}
if( j!=1 && i==1) res[i][j]=res[i][j-1]+grid[m-i][n-j];
if(i!=1 && j==1) res[i][j]=res[i-1][j]+grid[m-i][n-j];
if(i==1 && j==1 ) res[i][j]=grid[m-1][n-1];
}
}
return res[m][n];
}
};