leetcode【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.

源码：

还是动态规划，和前两题差不多。leetcode【61】Rotate List，leetcode【62】Unique Paths

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        if(grid.size() == 0)    return 0;
        int m = grid.size(), n = grid[0].size();
        vector<vector<int>> cost(m, vector<int>(n, 0));
        
        cost[0][0] = grid[0][0];
        for(int i=1; i<n; i++)  cost[0][i] = cost[0][i-1]+grid[0][i];
        for(int i=1; i<m; i++)  cost[i][0] = cost[i-1][0]+grid[i][0];
        // cout<<cost[1][0]<<endl;
        
        for(int i=1; i<m; i++){
            for(int j=1; j<n; j++){
                cost[i][j] = min(cost[i-1][j], cost[i][j-1]) + grid[i][j];
            }
        }
        return cost[m-1][n-1];
    }
};