62. 不同路径
一个机器人位于一个 m x n 网格的左上角 (起始点在下图中标记为“Start” )。机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角(在下图中标记为“Finish”)。问总共有多少条不同的路径?
class Solution:
def uniquePaths(self, m: int, n: int) -> int:
dp = [[1] * n] + [[1] + [0] * (n - 1) for _ in range(m-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]
- 空间复杂度优化:
不需要储存网格中的所有状态,我们需要的只是每一行最后的结果。
类似跳台阶,不需要记录每一级台阶的跳法,只保存一个结果保证每一步的结果更新到下一步即可。
class Solution:
def uniquePaths(self, m: int, n: int) -> int:
current = [1] * n
for i in range(1, m):
for j in range(1, n):
current[j] += current[j-1]
return current[-1]
63. 不同路径 II
现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径?
思路:
由于要先给出一个首行首列的初始值,但不能确定是否有障碍物,需要挨个进行判断,太繁琐惹。。。
添加一个虚拟的边界
(首行首列),则原始的首行首列可以类似网格中其他的行列操作
最后返回的是dp[-2]
class Solution:
def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
if not obstacleGrid: return 0
m = len(obstacleGrid)
n = len(obstacleGrid[0])
dp = [1] + [0] * n
for i in range(0, m):
for j in range(0, n):
dp[j] = 0 if obstacleGrid[i][j] else dp[j] + dp[j - 1]
return dp[-2]
直接解法l
挨个进行判断,原地更新,空间复杂度低,但循环次数变多了
class Solution:
def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
if not obstacleGrid: return 0
m = len(obstacleGrid)
n = len(obstacleGrid[0])
if obstacleGrid[0][0] == 1:
return 0
obstacleGrid[0][0] = 1
for i in range(1, m):
obstacleGrid[i][0] = int(obstacleGrid[i][0] != 1 and obstacleGrid[i - 1][0] == 1)
for j in range(1, n):
obstacleGrid[0][j] = int(obstacleGrid[0][j] != 1 and obstacleGrid[0][j - 1] == 1)
for i in range(1, m):
for j in range(1, n):
obstacleGrid[i][j] = 0 if obstacleGrid[i][j] == 1 else obstacleGrid[i - 1][j] + obstacleGrid[i][j - 1]
return obstacleGrid[-1][-1]