algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1744 from lihuacai168/master

Browse Source 
update 63不同路径II.md python
This commit is contained in:
程序员Carl
2022-11-22 09:58:00 +08:00
committed by GitHub
parent 2224f82ab9 ece7623da2
commit fd25f8f0af
1 changed files with 14 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
problems/0063.不同路径II.md
View File

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