-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathunique_path_II.py
44 lines (31 loc) · 1.21 KB
/
unique_path_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
class Solution(object):
def uniquePathsWithObstacles(self, obstacleGrid):
"""
:type obstacleGrid: List[List[int]]
:rtype: int
"""
if len(obstacleGrid) <= 0:
return 0
dp = [[0 for i in range(len(obstacleGrid[0]))] for j in range(len(obstacleGrid))]
if obstacleGrid[0][0] == 1:
dp[0][0] = 0
else:
dp[0][0] = 1
for i in range(1, len(obstacleGrid[0])):
if obstacleGrid[0][i] == 1:
dp[0][i] = 0
else:
dp[0][i] += dp[0][i-1]
for i in range(1, len(obstacleGrid)):
if obstacleGrid[i][0] == 1:
dp[i][0] = 0
else:
dp[i][0] += dp[i-1][0]
for i in range(1, len(obstacleGrid)):
for j in range(1, len(obstacleGrid[0])):
if obstacleGrid[i][j] == 1:
dp[i][j] = 0
continue
else:
dp[i][j] = dp[i-1][j] + dp[i][j-1]
return dp[len(obstacleGrid)-1][len(obstacleGrid[0])-1]