From db21410f39bcfd243509f7968e590a890ca8b93d Mon Sep 17 00:00:00 2001
From: LiangDazhu <42199191+LiangDazhu@users.noreply.github.com>
Date: Wed, 26 May 2021 23:42:33 +0800
Subject: [PATCH] =?UTF-8?q?Update=200062.=E4=B8=8D=E5=90=8C=E8=B7=AF?=
 =?UTF-8?q?=E5=BE=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Added python version code
---
 problems/0062.不同路径.md | 14 ++++++++++++--
 1 file changed, 12 insertions(+), 2 deletions(-)

diff --git a/problems/0062.不同路径.md b/problems/0062.不同路径.md
index c4673a23..751afcf8 100644
--- a/problems/0062.不同路径.md
+++ b/problems/0062.不同路径.md
@@ -86,7 +86,7 @@ public:
 
 ### 动态规划
 
-机器人从(0 , 0) 位置触发，到(m - 1, n - 1)终点。
+机器人从(0 , 0) 位置出发，到(m - 1, n - 1)终点。
 
 按照动规五部曲来分析：
 
@@ -246,7 +246,17 @@ Java：
 
 
 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