feat: add typescript solution to lc problem: No.0062.Unique Paths

solution/0000-0099/0062.Unique Paths/README.md

@@ -99,6 +99,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function uniquePaths(m: number, n: number): number {
+    let dp = Array.from({length: m}, v => new Array(n).fill(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++**
 
 ```cpp

solution/0000-0099/0062.Unique Paths/README_EN.md

@@ -89,6 +89,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function uniquePaths(m: number, n: number): number {
+    let dp = Array.from({length: m}, v => new Array(n).fill(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++**
 
 ```cpp

solution/0000-0099/0062.Unique Paths/Solution.ts

@@ -0,0 +1,9 @@
+function uniquePaths(m: number, n: number): number {
+    let dp = Array.from({length: m}, v => new Array(n).fill(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];
+};