63. 不同路径 II
class Solution(object):
def uniquePathsWithObstacles(self, obstacleGrid):
"""
:type obstacleGrid: List[List[int]]
:rtype: int
"""
m = len(obstacleGrid)
n = len(obstacleGrid[0])
res = [[0] * n for i in range(m)]
for i in range(m):
for j in range(n):
if obstacleGrid[i][j] == 0:
if i == j == 0:
res[i][j] = 1
else:
a = res[i][j-1] if j != 0 else 0
b = res[i-1][j] if i != 0 else 0
res[i][j] = res[i][j-1] + res[i-1][j]
return res[m-1][n-1]
思路:
动态规划。
综上,时间复杂度O(mn),空间复杂度是O(mn)。
注意点:
0那个位置特别标注为1,第0行和第0列做特别处理。