SunnyQjm/algorithm-review
1
0 Fork 0
mirror of https://github.com/SunnyQjm/algorithm-review.git synced 2026-10-05 01:15:46 +08:00
Code Issues Releases Wiki Activity

Update 9_unique-paths-ii.py

Browse Source
This commit is contained in:
SunnyQjm authored and GitHub committed 2020-06-20 22:25:57 +08:00
1 parent dae841e79e
commit 6f4c145338
1 file changed
+1 -1
Download Patch File Download Diff File Expand all files Collapse all files
chapter6/9_unique-paths-ii.py
+1 -1
View File
@@ -43,7 +43,7 @@ class Solution:
f(i, j) = f(i + 1, j) + f(i, j + 1) i+1 < m && j+1 < n && obstacleGrid[i][j] != 1
f(i + 1, j) i+1 < m && j+1 == n && obstacleGrid[i][j] != 1
f(i, j + 1) i+1 == m && j+1 < n && obstacleGrid[i][j] != 1
0 (i+1 == m && j+1 == n) || obstacleGrid[i][j] != 1
0 (i+1 == m && j+1 == n) || obstacleGrid[i][j] == 1
"""
m, n = len(obstacleGrid), len(obstacleGrid[0])
dp = [[0 for i in range(n)] for i in range(m)]