Leetcode_64_最小路径和_动态规划

经典倒着算的dp ，可能出错的地方在循环的退出条件。

// 冲刺061
class Solution {
    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int m1 = m - 1;
        int n1 = n - 1;

        // 防止越界的预处理
        for (int i = m1 - 1; i >= 0; i--) {
            grid[i][n1] += grid[i + 1][n1];
        }
        for (int i = n1 - 1; i >= 0; i--) {
            grid[m1][i] += grid[m1][i + 1];
        }
        m1--;
        n1--;

        while (m1 >= 0 && n1 >= 0) {
            for (int i = m1; i >= 0; i--) {
                grid[i][n1] += Math.min(grid[i + 1][n1], grid[i][n1 + 1]);
            }
            for (int i = n1 - 1; i >= 0; i--) {
                grid[m1][i] += Math.min(grid[m1][i + 1], grid[m1 + 1][i]);
            }
            m1--;
            n1--;
        }
        return grid[0][0];
    }
}