LeetCode OJ算法题（六十三）：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.

解法：

一样使用DP算法，维护一张m*n的表result，result[i][j]存储的是从左上角（0,0）移动到(i,j)的最小路径和，很明显我们有递推式：

result[i][j] = grid[i][j] + (result[i-1][j]<result[i][j-1]?result[i-1][j]:result[i][j-1]);

代码如下：

public class No63_MinimumPathSum {
	public static void main(String[] args){
		System.out.println(minPathSum(new int[][]{{1,2,3},{4,5,6},{7,8,9}}));
	}
	public static int minPathSum(int[][] grid) {
		int m = grid.length;
		if(m == 0) return 0;
		int n = grid[0].length;
        int[][] result = new int[m][n];
        result[0][0] = grid[0][0];
        for(int i=1;i<m;i++)
        	result[i][0] = result[i-1][0]+grid[i][0];
        for(int j=1;j<n;j++){
        	result[0][j] = result[0][j-1]+grid[0][j];
        }
        for(int i=1;i<m;i++){
        	for(int j=1;j<n;j++){
        		result[i][j] = grid[i][j] + (result[i-1][j]<result[i][j-1]?result[i-1][j]:result[i][j-1]);
        	}
        }
        return result[m-1][n-1];
    }
}