From fe730eab542a78d4eeda56f2a9cf69abdac6a46a Mon Sep 17 00:00:00 2001
From: hailincai <hailin.cai.neulion@gmail.com>
Date: Tue, 2 Nov 2021 08:00:36 -0400
Subject: [PATCH] =?UTF-8?q?0063.=E4=B8=8D=E5=90=8C=E8=B7=AF=E5=BE=84II.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

修改Java代码，更容易让人理解
---
 problems/0063.不同路径II.md | 16 +++++++---------
 1 file changed, 7 insertions(+), 9 deletions(-)

diff --git a/problems/0063.不同路径II.md b/problems/0063.不同路径II.md
index c2f8ec20..e25eb43a 100644
--- a/problems/0063.不同路径II.md
+++ b/problems/0063.不同路径II.md
@@ -179,16 +179,14 @@ class Solution {
     public int uniquePathsWithObstacles(int[][] obstacleGrid) {
         int n = obstacleGrid.length, m = obstacleGrid[0].length;
         int[][] dp = new int[n][m];
-        dp[0][0] = 1 - obstacleGrid[0][0];
-        for (int i = 1; i < m; i++) {
-            if (obstacleGrid[0][i] == 0 && dp[0][i - 1] == 1) {
-                dp[0][i] = 1;
-            }
+	
+        for (int i = 0; i < m; i++) {
+	    if (obstacleGrid[0][i] == 1) break; //一旦遇到障碍，后续都到不了
+	    dp[0][i] = 1;
         }
-        for (int i = 1; i < n; i++) {
-            if (obstacleGrid[i][0] == 0 && dp[i - 1][0] == 1) {
-                dp[i][0] = 1;
-            }
+        for (int i = 0; i < n; i++) {
+	    if (obstacleGrid[i][0] == 1) break; ////一旦遇到障碍，后续都到不了
+	    dp[i][0] = 1;
         }
         for (int i = 1; i < n; i++) {
             for (int j = 1; j < m; j++) {