add 2570

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -28,6 +28,7 @@
 | 2582 | [Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2582.java)                                       |                                      | Easy                           |
 | 2578 | [Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2578.java)                                       |                                      | Easy                           |
 | 2574 | [Left and Right Sum Differences](https://leetcode.com/problems/left-and-right-sum-differences/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2574.java)                                       |                                      | Easy                           |
+| 2570 | [Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2570.java)                                       |                                      | Easy                           |
 | 2566 | [Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/)                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2566.java)                                       |                                      | Easy                           |
 | 2562 | [Find the Array Concatenation Value](https://leetcode.com/problems/find-the-array-concatenation-value/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2562.java)                                       |                                      | Easy                           |
 | 2559 | [Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/)                                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2559.java)                                       |                                      | Medium                         |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2570.java

@@ -0,0 +1,43 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2570 {
+    public static class Solution1 {
+        public int[][] mergeArrays(int[][] nums1, int[][] nums2) {
+            List<int[]> mergedList = new ArrayList<>();
+            int i1 = 0;
+            int i2 = 0;
+            for (; i1 < nums1.length && i2 < nums2.length; ) {
+                int id1 = nums1[i1][0];
+                int id2 = nums2[i2][0];
+                if (id2 == id1) {
+                    mergedList.add(new int[]{id1, nums1[i1][1] + nums2[i2][1]});
+                    i1++;
+                    i2++;
+                } else if (id1 < id2) {
+                    mergedList.add(new int[]{id1, nums1[i1][1]});
+                    i1++;
+                } else {
+                    mergedList.add(new int[]{id2, nums2[i2][1]});
+                    i2++;
+                }
+            }
+            while (i1 < nums1.length) {
+                mergedList.add(new int[]{nums1[i1][0], nums1[i1][1]});
+                i1++;
+            }
+            while (i2 < nums2.length) {
+                mergedList.add(new int[]{nums2[i2][0], nums2[i2][1]});
+                i2++;
+            }
+            int[][] ans = new int[mergedList.size()][2];
+            for (int i = 0; i < mergedList.size(); i++) {
+                ans[i][0] = mergedList.get(i)[0];
+                ans[i][1] = mergedList.get(i)[1];
+            }
+            return ans;
+        }
+    }
+}