代码随想录算法训练营第39天| 动态规划

Leetcode.62 不同路径

dp = [[0]*(n+1) for _ in range(m+1)]
dp[0][1] = 1
for y in range(1, m+1):
    for x in range(1, n+1):
        dp[y][x] = dp[y-1][x] + dp[y][x-1]
return dp[-1][-1]

LeetCode.63 不同路径II

dp = [[0]*(len(obstacleGrid[0])+1) for _ in range(len(obstacleGrid)+1)]
dp[0][1] = 1
for y in range(1, len(dp)):
    for x in range(1, len(dp[0])):
        if not obstacleGrid[y-1][x-1]: dp[y][x] = dp[y-1][x] + dp[y][x-1]
return dp[-1][-1]