Minimum Path Sum

原题

https://leetcode.com/problems/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.
翻译：给定一个m*n的矩阵，每个位置有一个非负值，找到从左上角走到右下角的路径，使该路径的上面的值最小。
注：只能往右走或者往下走。

思路

　　还是一个动态规划的问题，对于每个位置，无非两个选择：从上面一格走过来，或者是从左边一格走过来，当然，对第一行和第一列，就只有一种选择了。

代码

　　代码应该可以解释他自己：

int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        if(m < 1) return 0;
        int n = grid[0].size();
        if(n < 1) return 0;

        for(int i  = 0; i < m; i++)
            for(int j = 0; j < n; j++)
            {
                if(i == 0 && j == 0)
                    continue;
                else if(i == 0)
                    grid[i][j] = grid[i][j - 1] + grid[i][j];
                else if(j == 0)
                    grid[i][j] = grid[i - 1][j] + grid[i][j];
                else
                    grid[i][j] = grid[i - 1][j] < grid[i][j - 1] ? grid[i - 1][j] + grid[i][j] : grid[i][j - 1] + grid[i][j];
            }

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