Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- """
- 62. Unique Paths
- 这道题在构建 dp 表格的时候,需要注意的是 最上面的row 和 最左边的column 是要等于前面一个值。因为这个是路径,他只能从他前面的一个cell中走过来。
- 所以,当 i=0 j=0的时候要给cell赋值 1
- """
- class Solution(object):
- def uniquePaths(self, m, n):
- """
- :type m: int
- :type n: int
- :rtype: int
- """
- if not m or not n:
- return 0
- dp = [0] * n
- for i in range(0, n):
- dp[i] = [0] * m
- for i in range(0, n):
- for j in range(0, m):
- if i == 0 and j == 0:
- dp[i][j] = 1
- elif i == 0 and j > 0:
- dp[i][j] = dp[i][j-1]
- elif i > 0 and j == 0:
- dp[i][j] = dp[i-1][j]
- else:
- dp[i][j] = dp[i-1][j] + dp[i][j-1]
- return dp[n-1][m-1]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement