Skip to content

Commit 7c9109d

Browse files
Merge branch 'master' of github.com:youngyangyang04/leetcode-master
2 parents 0c4aed8 + e6ab5a4 commit 7c9109d

File tree

1 file changed

+7
-9
lines changed

1 file changed

+7
-9
lines changed

problems/0063.不同路径II.md

Lines changed: 7 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -176,16 +176,14 @@ class Solution {
176176
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
177177
int n = obstacleGrid.length, m = obstacleGrid[0].length;
178178
int[][] dp = new int[n][m];
179-
dp[0][0] = 1 - obstacleGrid[0][0];
180-
for (int i = 1; i < m; i++) {
181-
if (obstacleGrid[0][i] == 0 && dp[0][i - 1] == 1) {
182-
dp[0][i] = 1;
183-
}
179+
180+
for (int i = 0; i < m; i++) {
181+
if (obstacleGrid[0][i] == 1) break; //一旦遇到障碍,后续都到不了
182+
dp[0][i] = 1;
184183
}
185-
for (int i = 1; i < n; i++) {
186-
if (obstacleGrid[i][0] == 0 && dp[i - 1][0] == 1) {
187-
dp[i][0] = 1;
188-
}
184+
for (int i = 0; i < n; i++) {
185+
if (obstacleGrid[i][0] == 1) break; ////一旦遇到障碍,后续都到不了
186+
dp[i][0] = 1;
189187
}
190188
for (int i = 1; i < n; i++) {
191189
for (int j = 1; j < m; j++) {

0 commit comments

Comments
 (0)