dp是一个m行n列的二维数组,其中dp[i][j]表示从起点[0, 0]到[i, j]有多少条路可达。状态转移方程为dp[i][j] = dp[i-1][j] + dp[i][j-1],为了保证计算dp[i][j]时它的左和上格子已经计算好,将起点初始化为0,将左上两条边的边缘格子初始化为1,随后逐行遍历dp数组直到右下角。
时间和空间都是O(m*n)
class Solution:
def uniquePaths(self, m: int, n: int) -> int:
dp = [[-1 for _ in range(n)] for _ in range(m)] #dp[i][j]: i行j列有多少路可达
# base
dp[0][0] = 0
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(1, n):
dp[i][j] = dp[i][j-1] + dp[i-1][j]
return dp[-1][-1]
可以将二维dp压缩为一维节省空间:注意到计算dp每行时仅与上一行相关,可以只维护长度为n的一维数组:时间O(n*m),空间O(n)
class Solution:
def uniquePaths(self, m: int, n: int) -> int:
dp = [1 for _ in range(n)]
for _ in range(1, m):
for i in range(1, n):
dp[i] += dp[i-1]
return dp[-1]
1)构建dp数组时所有元素初始化为0,这样一旦遇到障碍物可以直接break或continue。
2)当m、n大于1,dp[0][0]的值没有影响;但此题m、n可以为1,所以在初始化上、左边缘格子时应该将包括[0, 0]在内的格子初始化为1(当没有遇到障碍物)。
class Solution:
def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
m = len(obstacleGrid)
n = len(obstacleGrid[0])
if obstacleGrid[0][0] == 1 or obstacleGrid[-1][-1] == 1:
return 0
#base
dp = [[0 for _ in range(n)] for _ in range(m)]
for i in range(m):
if obstacleGrid[i][0] == 1:
break
dp[i][0] = 1
for j in range(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:
continue
else:
dp[i][j] = dp[i-1][j] + dp[i][j-1]
return dp[-1][-1]