-
Notifications
You must be signed in to change notification settings - Fork 265
/
063 Unique Paths II.py
63 lines (51 loc) · 1.9 KB
/
063 Unique Paths II.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
"""
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths would there be?
An obstacle and empty space is marked as 1 and 0 respectively in the grid.
For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.
[
[0,0,0],
[0,1,0],
[0,0,0]
]
The total number of unique paths is 2.
Note: m and n will be at most 100.
"""
__author__ = 'Danyang'
class Solution:
def uniquePathsWithObstacles(self, obstacleGrid):
"""
dp
:param obstacleGrid: a list of lists of integers
:return: integer
"""
m = len(obstacleGrid)
n = len(obstacleGrid[0])
# trivial
if obstacleGrid[0][0]==1 or obstacleGrid[m-1][n-1]==1:
return 0
path = [[0 for _ in range(n)] for _ in range(m)] # possible to optimize by [[0 for _ in range(n+1)]]
path[0][0] = 1 # start
# path[i][j] = path[i-1][j] + path[i][j-1]
for i in range(m):
for j in range(n):
if i==0 and j==0:
continue
if i==0:
path[i][j] = path[i][j-1] if obstacleGrid[i][j-1]==0 else 0
elif j==0:
path[i][j] = path[i-1][j] if obstacleGrid[i-1][j]==0 else 0
else:
if obstacleGrid[i][j-1]==0 and obstacleGrid[i-1][j]==0:
path[i][j] = path[i-1][j]+path[i][j-1]
elif obstacleGrid[i][j-1]==0:
path[i][j] = path[i][j-1]
elif obstacleGrid[i-1][j]==0:
path[i][j] = path[i-1][j]
else:
path[i][j]=0
return path[m-1][n-1]
if __name__=="__main__":
grid = [[0, 0], [1, 1], [0, 0]]
assert Solution().uniquePathsWithObstacles(grid)==0