LeetCode_Minimum Path Sum

iven 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.

　　动态规划： grid[i][j] += min(grid[i-1][j], grid[i][j-1])

class Solution {
public:
    int minPathSum(vector<vector<int> > &grid) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int m = grid.size();
        int n = grid[].size();

        for(int i = ; i< n ; i++)
             grid[][i] += grid[][i-];
        for(int j = ; j < m; j++)
            grid[j][] += grid[j-][];

        for( int i = ; i < m ; i++)
            for( int j = ; j < n ; j++)
            {
                int temp = grid[i-][j] < grid[i][j-] ? grid[i-][j] : grid[i][j-];
                grid[i][j] +=temp;
            }

        return grid[m-][n-];
    }
};