代码随想录刷题第三十九天

不同路径 (LC 62)

题目思路：

代码实现：

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

不同路径 II (LC 63)

题目思路：

代码实现：

class Solution:def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:m = len(obstacleGrid)n = len(obstacleGrid[0])dp = [[0 for _ in range(n+1)] for _ in range(m+1)]dp[0][1] = 1for i in range(1,m+1):for j in range(1, n+1):if obstacleGrid[i-1][j-1]!=1:dp[i][j] = dp[i-1][j]+dp[i][j-1]return dp[m][n]