题目:62. Unique Paths
题目链接:https://leetcode.com/problems/unique-paths/description/
一个MxN的矩阵,起点在左上方,终点在右下方,每次只能向右或者向下移动一步,计算从起点到终点一共有多少种走法?
一个简单动态规划啦,位置grid[i][j]只能从grid[i-1][j]或者grid[i][j-1]移动一步到达嘛,所以到grid[i][j]的路径数量就等于到grid[i][j-1]的路径数量加上到grid[i-1][j]的路径数量。
Python:
class Solution(object):
def uniquePaths(self, m, n):
"""
:type m: int
:type n: int
:rtype: int
"""
dp=[[0 for col in range(n+1)] for row in range(m+1)]
dp[1][1]=1
for i in range(1,m+1):
for j in range(1,n+1):
if i==1 and j==1:
continue
dp[i][j]=dp[i-1][j]+dp[i][j-1]
return dp[m][n]