[LeetCode]Minimum Path Sum

public class Solution {
    public int minPathSum(int[][] grid) {
        
        int m = grid.length, n = grid[0].length;
        int[][] sums = new int[m][n];
        
        for(int i = 0; i < m; i ++){
            for(int j = 0; j < n; ++j){
                if(i == 0 && j == 0){
                    sums[i][j] = grid[i][j];
                }else if(i == 0 && j != 0){
                    sums[i][j] = grid[i][j] + sums[i][j-1];
                }else if(i !=0 && j == 0){
                    sums[i][j] = grid[i][j] + sums[i-1][j];
                }else {
                    sums[i][j] = Math.min(grid[i][j] + sums[i][j-1],grid[i][j] + sums[i-1][j]);
                }
            }
        }
        return sums[m-1][n-1];
    }
}

[LeetCode]Minimum Path Sum

原文：http://blog.csdn.net/youmengjiuzhuiba/article/details/44901135