动态规划五部曲:
1.确定dp[i][j]的含义:从(0,0)走到(i,j)的所有路径数
2.确定递推公式:dp[i][j] = dp[i][j-1]+dp[i-1][j]
3.dp数组如何初始化:dp[0][j]=1,dp[i][0]=1 (第一行无法从上往下走到,不能从转移方程里推导出来,所以必须初始化,第一列也是一样的。 )
4.遍历顺序:这里要看一下递推公式dp[i][j] = dp[i - 1][j] + dp[i][j - 1],dp[i][j]都是从其上方和左方推导而来,那么从左到右一层一层遍历就可以了。
这样就可以保证推导dp[i][j]的时候,dp[i - 1][j] 和 dp[i][j - 1]一定是有数值的。
5.举例推导dp数组
class Solution:
def uniquePaths(self, m: int, n: int) -> int:
dp = [[0]*n for _ in range(m)]
for i in range(m):
dp[i][0] = 1
for j in range(n):
dp[0][j] = 1
for i in range(1,m):
for j in range(n):
dp[i][j] = dp[i-1][j] + dp[i][j-1]
return dp[m-1][n-1]
与上一题整体思路大体一致。
注意点:
1.要知道遇到障碍dp[i][j]保持0就可以了。
2.初始化的部分,障碍及之后部分应该都是0
class Solution:
def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
m = len(obstacleGrid)
n = len(obstacleGrid[0])
if obstacleGrid[m - 1][n - 1] == 1 or obstacleGrid[0][0] == 1:
return 0
dp = [[0]*n for _ in range(m)]
#初始化
for i in range(m):
if obstacleGrid[i][0] == 0:
dp[i][0] = 1
else:
break
for j in range(n):
if obstacleGrid[0][j] == 0:
dp[0][j] = 1
else:
break
for i in range(1,m):
for j in range(1,n):
if obstacleGrid[i][j] == 1:
continue
dp[i][j] = dp[i-1][j] + dp[i][j-1]
return dp[m-1][n-1]