题目:https://leetcode.com/problems/minimum-path-sum/submissions/
简介:题目也主要是以DP作为核心思想吧,在翻看过评论体系内的阐述和大部分解法,确实都离不开DP的核心点,所以今天这题就没有过多的赘述,不过确实也正是触及到我昨天提到的过程之上的思考点,就是当前目标解是动态变化的,在此题中的方向就是当前目标解与上一目标解之前存在定量的转化关系,不过也只是属于初级题目。继续努力吧。
class Solution {
public int minPathSum(int[][] grid) {
Integer MinPath = 0;
int[][] MinPathGrid = new int[grid.length][grid[0].length];
for(int i = 0; i < grid.length; i++){
for(int j = 0; j < grid[i].length; j++){
if(i == 0 && j == 0){
MinPathGrid[i][j] = grid[i][j];
}else if(i == 0){
MinPathGrid[i][j] = grid[i][j] + MinPathGrid[i][j-1];
}else if(j == 0){
MinPathGrid[i][j] = MinPathGrid[i-1][j] + grid[i][j];
}else{
MinPathGrid[i][j] = Math.min(MinPathGrid[i-1][j], MinPathGrid[i][j-1]) + grid[i][j];
}
}
}
return MinPathGrid[MinPathGrid.length-1][MinPathGrid[0].length-1];
}
}