【leetcode】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.

---

题解：类似Unique Paths这道题，只是初始化和更新answer数组的方式不同。

代码如下(Java):

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