feat: add ts solution to lc problem: No.2570 (doocs#898)

No.2570. Merge Two 2D Arrays by Summing Values

Author: thinkasany

solution/2500-2599/2570.Merge Two 2D Arrays by Summing Values/README.md

@@ -160,6 +160,28 @@ func mergeArrays(nums1 [][]int, nums2 [][]int) (ans [][]int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function mergeArrays(nums1: number[][], nums2: number[][]): number[][] {
+    const n = 1001;
+    const cnt = new Array(n).fill(0);
+    for (const [a, b] of nums1) {
+        cnt[a] += b;
+    }
+    for (const [a, b] of nums2) {
+        cnt[a] += b;
+    }
+    const ans: number[][] = [];
+    for (let i = 0; i < n; ++i) {
+        if (cnt[i] > 0) {
+            ans.push([i, cnt[i]]);
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2570.Merge Two 2D Arrays by Summing Values/README_EN.md

@@ -144,6 +144,28 @@ func mergeArrays(nums1 [][]int, nums2 [][]int) (ans [][]int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function mergeArrays(nums1: number[][], nums2: number[][]): number[][] {
+    const n = 1001;
+    const cnt = new Array(n).fill(0);
+    for (const [a, b] of nums1) {
+        cnt[a] += b;
+    }
+    for (const [a, b] of nums2) {
+        cnt[a] += b;
+    }
+    const ans: number[][] = [];
+    for (let i = 0; i < n; ++i) {
+        if (cnt[i] > 0) {
+            ans.push([i, cnt[i]]);
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2570.Merge Two 2D Arrays by Summing Values/Solution.ts

@@ -0,0 +1,17 @@
+function mergeArrays(nums1: number[][], nums2: number[][]): number[][] {
+    const n = 1001;
+    const cnt = new Array(n).fill(0);
+    for (const [a, b] of nums1) {
+        cnt[a] += b;
+    }
+    for (const [a, b] of nums2) {
+        cnt[a] += b;
+    }
+    const ans: number[][] = [];
+    for (let i = 0; i < n; ++i) {
+        if (cnt[i] > 0) {
+            ans.push([i, cnt[i]]);
+        }
+    }
+    return ans;
+}