LeetCode --- Minimum Path Sum

题目链接

简单倒推

附上代码：

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