最小路径和

题目描述

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.

很简单的动态规划问题。

对于任意一个位置dp[i][j],其最小值应该为dp[i-1][j]和dp[i][j-1]中的最小值加上i，j位置的值

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