110 最小路径和

class Solution {
public:
    /**
     * @param grid: a list of lists of integers
     * @return: An integer, minimizes the sum of all numbers along its path
     */
    int minPathSum(vector<vector<int>> &grid) {
        // write your code here
        int row=grid.size();
    if (row==0)
    {
        return 0;
    }
    int col=grid[0].size();
    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 j=1;j<col;j++)//第一行;
    {
        dp[0][j]=dp[0][j-1]+grid[0][j];
    }

    for (int i=1;i<row;i++)
    {
        for (int j=1;j<col;j++)
        {
            dp[i][j]=min(dp[i][j-1],dp[i-1][j])+grid[i][j];
        }
    }
    return dp[row-1][col-1];
    }
};