[LeetCode]62. Unique Paths
62. Unique Paths
dp[i][j] = 1 (if i == 0 or j == 0)
dp[i][j] = dp[i-1][j] + dp[i][j-1] (if i != 0 and j != 0)
动态规划
class Solution(object):
def uniquePaths(self, m, n):
"""
:type m: int
:type n: int
:rtype: int
"""
dp = []
for i in range(m):
dp.append([0] * n)
for i in range(m):
for j in range(n):
if i == 0 or j == 0:
dp[i][j] = 1
else:
dp[i][j] = dp[i-1][j] + dp[i][j-1]
return dp[m-1][n-1]
关注公众号:数据结构与算法那些事儿,每天一篇数据结构与算法