最小路径和

题目链接:

https://leetcode-cn.com/problems/minimum-path-sum/submissions/

class Solution {
    public int minPathSum(int[][] grid) {
        
         int m = grid.length;
         int n = grid[0].length;
         int[][] dp = new int[m][n];

         for(int i = 0;i < m; i++){
             for(int j = 0; j < n; j++){

                 if(j == 0 &&i == 0){
                    dp[i][j] = grid[i][j];
                 }else if(j == 0){
                    dp[i][j] = grid[i][j] + dp[i-1][j];
                 }else if(i == 0){
                    dp[i][j] = grid[i][j] + dp[i][j-1];
                 }else{
                     dp[i][j] = grid[i][j] + Math.min(dp[i-1][j],dp[i][j-1]);
                 }
             }
         }
     return dp[m-1][n-1];
    }
}

解题参考思路：

https://leetcode-cn.com/problems/minimum-path-sum/solution/zui-xiao-lu-jing-he-dong-tai-gui-hua-gui-fan-liu-c/