6362. 合并两个二维数组 - 求和法

Author: w2xi

README.md

@@ -236,6 +236,7 @@
 |2341|[数组能形成多少数对](https://leetcode.cn/problems/maximum-number-of-pairs-in-array/)|[JavaScript](./algorithms/maximum-number-of-pairs-in-array.js)|Easy|
 |2351|[第一个出现两次的字母](https://leetcode.cn/problems/first-letter-to-appear-twice/)|[JavaScript](./algorithms/first-letter-to-appear-twice.js)|Easy|
 |6354|[找出数组的串联值](https://leetcode.cn/problems/find-the-array-concatenation-value/)|[JavaScript](./algorithms/find-the-array-concatenation-value.js)|Easy|
+|6362|[合并两个二维数组 - 求和法](https://leetcode.cn/problems/merge-two-2d-arrays-by-summing-values/)|[JavaScript]()|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|
 |剑指 Offer 05. 替换空格|[剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)|[JavaScript](./algorithms/ti-huan-kong-ge-lcof.js)|Easy|

algorithms/merge-two-2d-arrays-by-summing-values.js

@@ -0,0 +1,39 @@
+/**
+ * @param {number[][]} nums1
+ * @param {number[][]} nums2
+ * @return {number[][]}
+ */
+var mergeArrays = function (nums1, nums2) {
+  let left1 = 0;
+  let right1 = nums1.length - 1;
+  let left2 = 0;
+  let right2 = nums2.length - 1;
+
+  const result = [];
+
+  // 思路和合并两个有序数组一样
+
+  while (left1 <= right1 && left2 <= right2) {
+    const curr1 = nums1[left1];
+    const curr2 = nums2[left2];
+
+    if (curr1[0] < curr2[0]) {
+      result.push(curr1);
+      left1++;
+    } else if (curr1[0] > curr2[0]) {
+      result.push(curr2);
+      left2++;
+    } else {
+      result.push([curr1[0], curr1[1] + curr2[1]]);
+      left1++;
+      left2++;
+    }
+  }
+  if (left1 > right1) {
+    result.push(...nums2.slice(left2));
+  } else {
+    result.push(...nums1.slice(left1));
+  }
+
+  return result;
+};