简单的动态规划问题
class Solution:
def uniquePaths(self, m: int, n: int) -> int:
#明显的动态规划问题
#当机器人处于什么位置时路径唯一呢?
#因为只能下/右移
#故dp[-1][_] == 1 AND dp[_][-1] == 1
dp = []
for i in range(m):
if i < m - 1:
tempres = [ 0 for _ in range(n-1)]
tempres.append(1)
dp.append(tempres)
else:
tempres = [ 1 for _ in range(n)]
dp.append(tempres)
#在其它位置 dp[i][j] = dp[i+1][j] + dp[i][j+1]
for i in range(m-2,-1,-1):
for j in range(n-2,-1,-1):
dp[i][j] = dp[i+1][j] + dp[i][j+1]
return dp[0][0]