题目描述:
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.
Example:
Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1→3→1→1→1 minimizes the sum.
中文理解:
给定一个二维矩阵,矩阵的每个元素代表权重,给出一条从左上角走到右下角的路径权重之和最小。
解题思路:
使用dp[i][j]代表走到该路径的权重之和,初始赋值第一行的每个值为dp[0][j]=dp[0][j-1]+grid[0][j],第一列的值为dp[i][0]=dp[i-1][0]+grid[i][0],然后每个位置dp[i][j]=Math.min(dp[i-1][j],dp[i][j-1])+grid[i][j],最终返回dp[len1-1][len2-1]值即可。
代码(java):
class Solution {
public int minPathSum(int[][] grid) {
if(grid.length==0)return 0;
int[][] dp=new int[grid.length][grid[0].length];
dp[0][0]=grid[0][0];
for(int i=1;i<grid.length;i++){
dp[i][0]=dp[i-1][0]+grid[i][0];
}
for(int i=1;i<grid[0].length;i++){
dp[0][i]=dp[0][i-1]+grid[0][i];
}
for(int i=1;i<grid.length;i++){
for(int j=1;j<grid[0].length;j++){
dp[i][j]=Math.min(dp[i][j-1],dp[i-1][j])+grid[i][j];
}
}
return dp[grid.length-1][grid[0].length-1];
}
}