algorithm/CS-Notes
1
0
Fork 0
mirror of https://github.com/CyC2018/CS-Notes.git synced 2025-07-13 23:40:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2018-12-17 18:27:21 +08:00
parent 4b35ec32a3
commit 76ad497f7d
1 changed files with 18 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
notes/Leetcode 题解.md
View File

@ -2551,22 +2551,16 @@ public int minPathSum(int[][] grid) {
int[] dp = new int[n]; int[] dp = new int[n];
for (int i = 0; i < m; i++) { for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) { for (int j = 0; j < n; j++) {
if(i==0) {
if (j == 0) { if (j == 0) {
dp[j] = grid[i][j]; dp[j] = dp[j]; // 只能从上侧走到该位置
} else if (i == 0) {
dp[j] = dp[j - 1]; // 只能从左侧走到该位置
} else {
dp[j] = Math.min(dp[j - 1], dp[j]);
} }
else { dp[j] += grid[i][j];
dp[j]=dp[j-1] + grid[i][j];
}
}else if(j==0) {
dp[j] = dp[j] + grid[i][j];
}
else{
dp[j] = Math.min(dp[j],dp[j-1])+grid[i][j];
} }
} }
}
return dp[n - 1]; return dp[n - 1];
} }
``` ```