Update 62.unique-paths.md

azl397985856 · web-flow · commit 3dc25f99a47b · 2020-02-10T12:26:09.000+08:00
diff --git a/problems/62.unique-paths.md b/problems/62.unique-paths.md
@@ -117,6 +117,10 @@ class Solution:
 - 空间复杂度可以进一步优化到O(n), 这会是一个考点
 ## 代码
 
+代码支持JavaScript，Python3
+
+JavaScript Code:
+
 ```js
 /*
  * @lc app=leetcode id=62 lang=javascript
@@ -143,6 +147,19 @@ var uniquePaths = function(m, n) {
 };
 ```
 
+Python3 Code:
+
+```python
+class Solution:
+
+    def uniquePaths(self, m: int, n: int) -> int:
+        dp = [1] * n
+        for _ in range(1, m):
+            for j in range(1, n):
+                dp[j] += dp[j - 1]
+        return dp[n - 1]
+```
+
  **复杂度分析**
  
  - 时间复杂度：$O(M * N)$
