From fc28660b6189b010709bedc7dd5acf678eaf47ed Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Sun, 1 May 2022 14:42:12 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880062.=E4=B8=8D?=
 =?UTF-8?q?=E5=90=8C=E8=B7=AF=E5=BE=84.md=EF=BC=89=EF=BC=9A=E5=A2=9E?=
 =?UTF-8?q?=E5=8A=A0typescript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0062.不同路径.md | 30 +++++++++++++++++++++++++++++-
 1 file changed, 29 insertions(+), 1 deletion(-)

diff --git a/problems/0062.不同路径.md b/problems/0062.不同路径.md
index 4a9af129..f59b7be8 100644
--- a/problems/0062.不同路径.md
+++ b/problems/0062.不同路径.md
@@ -273,7 +273,7 @@ public:
         return dp[m-1][n-1];
     }
 
-``` 
+```
 
 ### Python 
 ```python
@@ -347,7 +347,35 @@ var uniquePaths = function(m, n) {
 };
 ```
 
+### TypeScript
+
+```typescript
+function uniquePaths(m: number, n: number): number {
+    /**
+        dp[i][j]: 到达(i, j)的路径数
+        dp[0][*]: 1;
+        dp[*][0]: 1;
+        ...
+        dp[i][j]: dp[i - 1][j] + dp[i][j - 1];
+     */
+    const dp: number[][] = new Array(m).fill(0).map(_ => []);
+    for (let i = 0; i < m; i++) {
+        dp[i][0] = 1;
+    }
+    for (let i = 0; i < n; i++) {
+        dp[0][i] = 1;
+    }
+    for (let i = 1; i < m; i++) {
+        for (let j = 1; j < n; j++) {
+            dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
+        }
+    }
+    return dp[m - 1][n - 1];
+};
+```
+
 ### C
+
 ```c
 //初始化dp数组
 int **initDP(int m, int n) {