mirror of
https://github.com/CyC2018/CS-Notes.git
synced 2025-07-10 21:40:55 +08:00
Fix a bug in the Minimum Path Sum solution
Check boundary
This commit is contained in:
@ -2505,9 +2505,9 @@ public int minPathSum(int[][] grid) {
|
|||||||
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 (i == 0) {
|
||||||
dp[j] = dp[j - 1];
|
if (j>0) dp[j] = dp[j - 1];
|
||||||
} else {
|
} else {
|
||||||
dp[j] = Math.min(dp[j - 1], dp[j]);
|
if (j>0) dp[j] = Math.min(dp[j - 1], dp[j]);
|
||||||
}
|
}
|
||||||
dp[j] += grid[i][j];
|
dp[j] += grid[i][j];
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user