feat: add typescript solution to lc problem: No.1899.Merge Triplets to Form Target Triplet (#453)

Author: zhaocchen

solution/1800-1899/1899.Merge Triplets to Form Target Triplet/README.md

@@ -113,6 +113,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function mergeTriplets(triplets: number[][], target: number[]): boolean {
+    let [x, y, z] = target; // 目标值
+    let [i, j, k] = [0, 0, 0]; // 最大值
+    for (let triplet of triplets) {
+        let [a, b, c] = triplet; // 当前值
+        if (a <= x && b <= y && c <= z) {
+            i = Math.max(i, a);
+            j = Math.max(j, b);
+            k = Math.max(k, c);
+        }
+    }
+    return i == x && j == y && k == z;
+};
+```
+
 ### **...**
 
 ```

solution/1800-1899/1899.Merge Triplets to Form Target Triplet/README_EN.md

@@ -103,6 +103,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function mergeTriplets(triplets: number[][], target: number[]): boolean {
+    let [x, y, z] = target; // 目标值
+    let [i, j, k] = [0, 0, 0]; // 最大值
+    for (let triplet of triplets) {
+        let [a, b, c] = triplet; // 当前值
+        if (a <= x && b <= y && c <= z) {
+            i = Math.max(i, a);
+            j = Math.max(j, b);
+            k = Math.max(k, c);
+        }
+    }
+    return i == x && j == y && k == z;
+};
+```
+
 ### **...**
 
 ```

solution/1800-1899/1899.Merge Triplets to Form Target Triplet/Solution.ts

@@ -0,0 +1,13 @@
+function mergeTriplets(triplets: number[][], target: number[]): boolean {
+    let [x, y, z] = target; // 目标值
+    let [i, j, k] = [0, 0, 0]; // 最大值
+    for (let triplet of triplets) {
+        let [a, b, c] = triplet; // 当前值
+        if (a <= x && b <= y && c <= z) {
+            i = Math.max(i, a);
+            j = Math.max(j, b);
+            k = Math.max(k, c);
+        }
+    }
+    return i == x && j == y && k == z;
+};