算法：64. Minimum Path Sum最小路径和

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 1:

Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Explanation: Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.

Example 2:

Input: grid = [[1,2,3],[4,5,6]]
Output: 12

Constraints:

m == grid.length
n == grid[i].length
1 <= m, n <= 200
0 <= grid[i][j] <= 100

动态规划解法

动态规划递推公式：grid[r][c] += Math.min(grid[r - 1][c], grid[r][c - 1]);
其中r表示row行，c表示column列。
注意第一行和第一列需要特殊处理，只要加上上一个数字即可。

class Solution {
    public int minPathSum(int[][] grid) {
        int rl = grid.length;
        int cl = grid[0].length;
        for (int r = 1; r < rl; r++) {
            grid[r][0] += grid[r - 1][0];
        }
        for (int c = 1; c < cl; c++) {
            grid[0][c] += grid[0][c - 1];
        }
        for (int r = 1; r < rl; r++) {
            for (int c = 1; c < cl; c++) {
                grid[r][c] += Math.min(grid[r - 1][c], grid[r][c - 1]);
            }
        }
        
        return grid[rl - 1][cl -1];
    }
}