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矩阵grid，含有非负整数。找出一条路径从最左上角到右下角，使之经过元素之和最小。假定只能向右或向下移动

思路：还是根据动态规划的思想。和前面的路径个数的题类似

二维数组path记录当前位置结束的路径的最小和，比如path[i][j]代表从grid[0][0]开始到grid[i][j]结束的最小路径和。

程序最后返回path[m-1][n-1]，即从最左上角到右下角的最小路径和

public class Solution {
    public int minPathSum(int[][] grid) {
        int rows = grid.length;
        int cols = grid[0].length;
        int[][] path = new int[rows][cols];
        path[0][0] = grid[0][0];
        //左边界
        for (int i = 1; i < rows; i++) {
			path[i][0] = path[i-1][0] + grid[i][0];
		}
        //上边界
        for (int i = 1; i < cols; i++) {
			path[0][i] = path[0][i-1] + grid[0][i];
		}
        
        for (int i = 1; i < rows; i++) {
			for (int j = 1; j < cols; j++) {
				path[i][j] = Math.min(path[i][j-1], path[i-1][j]) + grid[i][j];
			}
		}
        return path[rows-1][cols-1];
    }
}