题目:https://leetcode-cn.com/problems/unique-paths-ii/
一个机器人位于一个 m x n 网格的左上角 (起始点在下图中标记为“Start” )。
机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角(在下图中标记为“Finish”)。
现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径?
网格中的障碍物和空位置分别用 1 和 0 来表示。
示例 1:
输入:obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]
输出:2
解释:
3x3 网格的正中间有一个障碍物。
从左上角到右下角一共有 2 条不同的路径:
1. 向右 -> 向右 -> 向下 -> 向下
2. 向下 -> 向下 -> 向右 -> 向右
示例 2:
输入:obstacleGrid = [[0,1],[0,0]]
输出:1
提示:
m == obstacleGrid.length
n == obstacleGrid[i].length
1 <= m, n <= 100
obstacleGrid[i][j] 为 0 或 1
解题思路:
62题动态规划的延伸,62题解题详见:https://blog.csdn.net/anningne/article/details/112284336
转移方程为
if(obstacleGrid[i - 1][j] == 1 and obstacleGrid[i][j - 1] == 1):
dp[i][j] = 0
elif(obstacleGrid[i - 1][j] == 1):
dp[i][j] = dp[i][j - 1]
elif(obstacleGrid[i][j - 1] == 1):
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
即看dp[i][j]的上方和左方有哪里堵住了,证明那条路不通,不计入此条路的路径数。
这道题难点在于边界值的判断:
1. obstacleGrid[0][0]为1直接得路径数0
2. obstacleGrid[m - 1][n - 1] 为1直接得路径数0
3. i==0或者j==0即方格的最上面一行和最左边一列,为初始值,无障碍时路径数都是1,有障碍的位置后面全是零,可用obstacleGrid[i][j] == 1 or dp[i][j - 1] == 0和obstacleGrid[i][j] == 1 or dp[i - 1][j] == 0来判断,注意起始点为dp[0][0]=1(obstacleGrid[0][0]为1的情况已经在条件1 return了)
代码:
class Solution:
def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
m = len(obstacleGrid)
n = len(obstacleGrid[0])
dp = [[0] * n for _ in range(m)]
if(obstacleGrid[m - 1][n - 1] == 1 or obstacleGrid[0][0] == 1):
return 0
for i in range(0, m):
for j in range(0, n):
if(i == 0):
if(j == 0):
dp[i][j] = 1
elif(obstacleGrid[i][j] == 1 or dp[i][j - 1] == 0):
dp[i][j] = 0
else:
dp[i][j] = 1
elif(j == 0):
if(i == 0):
dp[i][j] = 1
elif(obstacleGrid[i][j] == 1 or dp[i - 1][j] == 0):
dp[i][j] = 0
else:
dp[i][j] = 1
else:
if(obstacleGrid[i - 1][j] == 1 and obstacleGrid[i][j - 1] == 1):
dp[i][j] = 0
elif(obstacleGrid[i - 1][j] == 1):
dp[i][j] = dp[i][j - 1]
elif(obstacleGrid[i][j - 1] == 1):
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
return dp[m - 1][n - 1]
测试:
if __name__ == "__main__":
obstacleGrid = [[0,1],[0,0]]
res = Solution().uniquePathsWithObstacles(obstacleGrid)
print(res)