动态规划
62. 不同路径
class Solution(object):
def uniquePaths(self, m, n):
"""
:type m: int
:type n: int
:rtype: 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-1][j]+dp[i][j-1]
return dp[-1][-1]
63. 不同路径 II
64. 最小路径和
class Solution(object):
def minPathSum(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
dp=[[0 for j in range(len(grid[0]))]for i in range(len(grid))]
dp[0][0]=grid[0][0]
for j in range(1,len(dp[0])):
dp[0][j]=dp[0][j-1]+grid[0][j]
for i in range(1,len(dp)):
dp[i][0]=dp[i-1][0]+grid[i][0]
for i in range(1,len(grid)):
for j in range(1,len(grid[0])):
dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j]
return dp[-1][-1]
回溯
https://blog.csdn.net/MaYingColdPlay/article/details/105761481