問題描述：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.

問題分析：參考路徑問題，其實就是加權(quán)的路徑問題，求最小的權(quán)值和。動態(tài)規(guī)劃問題，核心遞推公式，d[i][j] = min(d[i-1][j],d[i][j-1])+a[i][j].

public class MinPathSum {public int minPathSum(int[][] grid){for(int i = 1; i < grid.length; i ++)//初始化第一行第一列{grid[i][0] += grid[i-1][0];}for(int i = 1; i < grid[0].length; i ++){grid[0][i] += grid[0][i-1];}for(int i = 1; i < grid.length; i ++){for(int j = 1; j < grid[0].length; j ++){grid[i][j] = Math.min(grid[i-1][j], grid[i][j-1])+grid[i][j];//核心遞推公式}}return grid[grid.length-1][grid[0].length];} }

?

轉(zhuǎn)載于:https://www.cnblogs.com/masterlibin/p/5775955.html

總結(jié)

以上是生活随笔為你收集整理的Minimum Path Sum，最短路径问题，动态规划的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。