【代码随想录算法训练营】第39天 | 第九章 动态规划（二）+ 复习第10天 第四章 字符串（三）

主要内容

不同路径

动态规划题目

62.不同路径

思路分析

dp[i][j]表示到达[i,j]的路径数
递推公式 dp[i][j] = dp[i-1][j]+dp[i][j-1]
初始化dp[0][0] = 1, dp[0][j] = 1, dp[i][0] = 0
递推顺序，一行一行推

代码

class Solution:
    # dp[i][j]表示到达[i,j]的路径数
    # 递推公式 dp[i][j] = dp[i-1][j]+dp[i][j-1]
    # 初始化dp[0][0] = 1, dp[0][j] = 1, dp[i][0] = 0
    # 递推顺序，一行一行推
    def uniquePaths(self, m: int, n: int) -> int:
        dp = [[1] * n for _ in range(m)]
        for i in range(1, m):
            for j in range(1, n):
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
        # for i in range(m):
        #     for j in range(n):
        #         print(dp[i][j], end=' ')
        #     print('\n')
        return dp[m-1][n-1]
        

63. 不同路径 II

思路分析

dp[i][j]表示到达[i,j]的路径数
递推公式 dp[i][j] = dp[i-1][j]+dp[i][j-1] if 没有障碍物 else 0
初始化dp[0][j] = 1, dp[i][0] = 0，如果有障碍物，其后的dp均为0
遍历顺序逐行遍历

代码

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        m = len(obstacleGrid)
        n = len(obstacleGrid[0])
        dp = [[1] * n for _ in range(m)]
        # 先去除边缘上的障碍物路径
        flagj = -1
        for i in range(n):
            if obstacleGrid[0][i] == 1:
                dp[0][i] = 0
                flagj = i
                break
        if flagj >= 0:
            for j in range(flagj, n):
                dp[0][j] = 0

        flagi = -1
        for i in range(m):
            if obstacleGrid[i][0] == 1:
                dp[i][0] = 0
                flagi = i
                break
        if flagi >= 0 :
            for i in range(flagi, m):
                dp[i][0] = 0

        # 再逐行遍历
        for i in range(1, m):
            for j in range(1, n):
                if obstacleGrid[i][j] == 1:
                    dp[i][j] = 0
                else:
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
        # for i in range(m):
        #     for j in range(n):
        #         print(dp[i][j], end=' ')
        #     print('\n')
        return dp[m - 1][n - 1]