Merge pull request youngyangyang04#1744 from lihuacai168/master

update 63不同路径II.md python

Author: youngyangyang04

problems/0063.不同路径II.md

@@ -272,24 +272,28 @@ class Solution:
         row = len(obstacleGrid)
         col = len(obstacleGrid[0])
         dp = [[0 for _ in range(col)] for _ in range(row)]
-
-        dp[0][0] = 1 if obstacleGrid[0][0] != 1 else 0
-        if dp[0][0] == 0: return 0  # 如果第一个格子就是障碍，return 0
+        dp[0][0] = 0 if obstacleGrid[0][0] == 1 else 1
+        if dp[0][0] == 0:
+            return 0  # 如果第一个格子就是障碍，return 0
         # 第一行
         for i in range(1, col):
-            if obstacleGrid[0][i] != 1:
-                dp[0][i] = dp[0][i-1]
+            if obstacleGrid[0][i] == 1:
+                # 遇到障碍物时，直接退出循环，后面默认都是0
+                break
+            dp[0][i] = 1
 
         # 第一列
         for i in range(1, row):
-            if obstacleGrid[i][0] != 1:
-                dp[i][0] = dp[i-1][0]
-        print(dp)
+            if obstacleGrid[i][0] == 1:
+                # 遇到障碍物时，直接退出循环，后面默认都是0
+                break
+            dp[i][0] = 1
+        # print(dp)
 
         for i in range(1, row):
             for j in range(1, col):
-                if obstacleGrid[i][j] != 1:
-                    dp[i][j] = dp[i-1][j] + dp[i][j-1]
+                if obstacleGrid[i][j] == 0:
+                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
         return dp[-1][-1]
 ```