mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 11:34:46 +08:00
Update 0062.不同路径.md
Added python version code
This commit is contained in:
@ -86,7 +86,7 @@ public:
|
|||||||
|
|
||||||
### 动态规划
|
### 动态规划
|
||||||
|
|
||||||
机器人从(0 , 0) 位置触发,到(m - 1, n - 1)终点。
|
机器人从(0 , 0) 位置出发,到(m - 1, n - 1)终点。
|
||||||
|
|
||||||
按照动规五部曲来分析:
|
按照动规五部曲来分析:
|
||||||
|
|
||||||
@ -246,7 +246,17 @@ Java:
|
|||||||
|
|
||||||
|
|
||||||
Python:
|
Python:
|
||||||
|
```python
|
||||||
|
class Solution: # 动态规划
|
||||||
|
def uniquePaths(self, m: int, n: int) -> int:
|
||||||
|
dp = [[0 for i in range(n)] for j in range(m)]
|
||||||
|
for i in range(m): dp[i][0] = 1
|
||||||
|
for j in range(n): dp[0][j] = 1
|
||||||
|
for i in range(1, m):
|
||||||
|
for j in range(1, n):
|
||||||
|
dp[i][j] = dp[i][j - 1] + dp[i - 1][j]
|
||||||
|
return dp[m - 1][n - 1]
|
||||||
|
```
|
||||||
|
|
||||||
Go:
|
Go:
|
||||||
```Go
|
```Go
|
||||||
|
Reference in New Issue
Block a user