day39|动归2-不同路径_my最新路径-CSDN博客

本文链接：https://blog.csdn.net/weixin_47533705/article/details/130897081

下一个节点的路径个数等于上一个和左一个路径个数相加。

62.不同路径

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        dp = [[1] * n] + [[1] + [0] * (n-1) for _ in range(m-1)]
        for i in range(1,m):
            for j in range(1,n):
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[-1][-1]

63. 不同路径 II

在这里插入图片描述
递推五部曲：

dp[i][j]：到第(i,j)的位置上所需要的路径个数
递推公式：注意是带有条件的递推公式

if obstacleGrid[i][j] != 1:
                    dp[i][j] = dp[i-1][j] + dp[i][j-1]
                else:
                    dp[i][j] = 0

dp数组的初始化：注意在遇到障碍之后，后面的路径个数为0
遍历方式：从左到右，从上到下
打印dp数组

my solution

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        # 将有障碍物的地方设置成0
        m,n = len(obstacleGrid),len(obstacleGrid[0])
        dp = [[1] * n] + [[1] + [0] * (n-1) for _ in range(m-1)]
        if obstacleGrid[0][0] == 1:
            return 0
        for i in range(m):
            for j in range(n):
                if obstacleGrid[i][j] == 1:
                    dp[i][j] = 0
                    continue
                elif i == 0 and j >= 1: # 行方向
                    dp[i][j] = dp[i][j-1] 
                    continue
                elif j == 0 and i >= 1:
                    dp[i][j] = dp[i-1][j] 
                    continue
                elif i == 0 and j == 0:
                    continue
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[-1][-1]

代码随想录solution

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        # 设置dp数组
        m,n = len(obstacleGrid),len(obstacleGrid[0])
        dp = [[0] * n] + [[0] + [0] * (n-1) for _ in range(m-1)]
        # 边界条件处理
        dp[0][0] = 1
        if obstacleGrid[0][0] == 1:
            return 0
        # dp数组初始化
        for i in range(1,m):
            if obstacleGrid[i][0] == 1:
                break
            dp[i][0] = 1
        for j in range(1,n):
            if obstacleGrid[0][j] == 1:
                break
            dp[0][j] = 1
        # 递归公式
        for i in range(1,m):
            for j in range(1,n):
                if obstacleGrid[i][j] != 1:
                    dp[i][j] = dp[i-1][j] + dp[i][j-1]
                else:
                    dp[i][j] = 0
        return dp[-1][-1]