(java)Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right whichminimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

思路:本题就是一个普通的动态规划题目，因为只能往下或者往右走，递推式是dp[i][j]=Math.min(dp[i-1][j], dp[i][j-1])+grid[i][j];,根据此递推式可以得出算法

代码如下(已通过leetcode)

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