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.

z这道题一样用的动态规划；

public class Solution {
    public int minPathSum(int[][] grid) {
       int width = grid.length;
		int height = grid[0].length;
		int[][] dep = new int[width][height];
		dep[0][0] = grid[0][0];
		for (int i = 1; i < width; i++) {
			dep[i][0]=dep[i-1][0]+grid[i][0];
		}
		for (int i = 1; i < height; i++) {
			dep[0][i] = dep[0][i-1]+grid[0][i];
		}
		for (int i = 1; i < width; i++) {
			for (int j = 1; j < height; j++) {
				dep[i][j]=dep[i-1][j]>dep[i][j-1]?grid[i][j]+dep[i][j-1]:grid[i][j]+dep[i-1][j];
			}
		}
		return dep[width-1][height-1];
    }
}