feat: add typescript solution to lc problem: No.0118.Pascal's Triangle

Author: zhaocchen

solution/0100-0199/0118.Pascal's Triangle/README.md

@@ -74,6 +74,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function generate(numRows: number): number[][] {
+    if (numRows == 0) return [];
+    let ans = [[1]];
+    for (let i = 1; i < numRows; ++i) {
+        ans.push(new Array(i + 1).fill(1));
+        let half = i >> 1;
+        for (let j = 1;j <= half; ++j) {
+            let cur = ans[i - 1][j - 1] + ans[i - 1][j];
+            ans[i][j] = cur;
+            ans[i][i - j] = cur;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0100-0199/0118.Pascal's Triangle/README_EN.md

@@ -65,6 +65,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function generate(numRows: number): number[][] {
+    if (numRows == 0) return [];
+    let ans = [[1]];
+    for (let i = 1; i < numRows; ++i) {
+        ans.push(new Array(i + 1).fill(1));
+        let half = i >> 1;
+        for (let j = 1;j <= half; ++j) {
+            let cur = ans[i - 1][j - 1] + ans[i - 1][j];
+            ans[i][j] = cur;
+            ans[i][i - j] = cur;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0100-0199/0118.Pascal's Triangle/Solution.ts

@@ -0,0 +1,14 @@
+function generate(numRows: number): number[][] {
+    if (numRows == 0) return [];
+    let ans = [[1]];
+    for (let i = 1; i < numRows; ++i) {
+        ans.push(new Array(i + 1).fill(1));
+        let half = i >> 1;
+        for (let j = 1;j <= half; ++j) {
+            let cur = ans[i - 1][j - 1] + ans[i - 1][j];
+            ans[i][j] = cur;
+            ans[i][i - j] = cur;
+        }
+    }
+    return ans;
+};