algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #443 from jojoo15/patch-37

Browse Source 
优化 0062不同路径 python3版本
This commit is contained in:
程序员Carl
2021-06-28 15:23:54 +08:00
committed by GitHub
parent 5efc824e84 a921b3ba3d
commit d6770c07e3
1 changed files with 1 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0062.不同路径.md
View File

@ -279,9 +279,7 @@ Python：
```python ```python
class Solution: # 动态规划 class Solution: # 动态规划
def uniquePaths(self, m: int, n: int) -> int: def uniquePaths(self, m: int, n: int) -> int:
dp = [[0 for i in range(n)] for j in range(m)] dp = [[1 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 i in range(1, m):
for j in range(1, n): for j in range(1, n):
dp[i][j] = dp[i][j - 1] + dp[i - 1][j] dp[i][j] = dp[i][j - 1] + dp[i - 1][j]