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.

解题思路

1. 按照unique path的思想
2. 对于每一个grid[i][j]，可以到达它的最短路径，是取从grid[i-1][j],grid[i][j-1]的最小值加上自身的最小值。
3. 返回grid[n-1][m-1]

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