merge-two-2d-arrays-by-summing-values

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two 2D integer arrays <code>nums1</code> and <code>nums2.</code>

<ul>
	<li><code>nums1[i] = [idi, vali]</code>&nbsp;indicate that the number with the id <code>idi</code> has a value equal to <code>vali</code>.</li>
	<li><code>nums2[i] = [idi, vali]</code>&nbsp;indicate that the number with the id <code>idi</code> has a value equal to <code>vali</code>.</li>
</ul>

Each array contains unique ids and is sorted in ascending order by id.

Merge the two arrays into one array that is sorted in ascending order by id, respecting the following conditions:

<ul>
	<li>Only ids that appear in at least one of the two arrays should be included in the resulting array.</li>
	<li>Each id should be included only once and its value should be the sum of the values of this id in the two arrays. If the id does not exist in one of the two arrays, then assume its value in that array to be <code>0</code>.</li>
</ul>

Return the resulting array. The returned array must be sorted in ascending order by id.

&nbsp;
Example 1:

<pre>
Input: nums1 = [[1,2],[2,3],[4,5]], nums2 = [[1,4],[3,2],[4,1]]
Output: [[1,6],[2,3],[3,2],[4,6]]
Explanation: The resulting array contains the following:
- id = 1, the value of this id is 2 + 4 = 6.
- id = 2, the value of this id is 3.
- id = 3, the value of this id is 2.
- id = 4, the value of this id is 5 + 1 = 6.
</pre>

Example 2:

<pre>
Input: nums1 = [[2,4],[3,6],[5,5]], nums2 = [[1,3],[4,3]]
Output: [[1,3],[2,4],[3,6],[4,3],[5,5]]
Explanation: There are no common ids, so we just include each id with its value in the resulting list.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 200</code></li>
	<li><code>nums1[i].length == nums2[j].length == 2</code></li>
	<li><code>1 &lt;= idi, vali &lt;= 1000</code></li>
	<li>Both arrays contain unique ids.</li>
	<li>Both arrays are in&nbsp;strictly ascending order by id.</li>
</ul>

mergeArrays

Merge Two 2D Arrays by Summing Values

Merge Two Sorted Lists

merge-two-sorted-lists

合并两个有序链表

Meeting Scheduler

meeting-scheduler

安排会议日程

Merge Similar Items

merge-similar-items

合并相似的物品

Array

Hash Table

Two Pointers

给你两个 二维 整数数组 <code>nums1</code> 和 <code>nums2.</code>

<ul>
	<li><code>nums1[i] = [idi, vali]</code> 表示编号为 <code>idi</code> 的数字对应的值等于 <code>vali</code> 。</li>
	<li><code>nums2[i] = [idi, vali]</code>&nbsp;表示编号为 <code>idi</code> 的数字对应的值等于 <code>vali</code> 。</li>
</ul>

每个数组都包含 互不相同 的 id ，并按 id 以 递增 顺序排列。

请你将两个数组合并为一个按 id 以递增顺序排列的数组，并符合下述条件：

<ul>
	<li>只有在两个数组中至少出现过一次的 id 才能包含在结果数组内。</li>
	<li>每个 id 在结果数组中 只能出现一次 ，并且其对应的值等于两个数组中该 id 所对应的值求和。如果某个数组中不存在该 id ，则假定其对应的值等于 <code>0</code> 。</li>
</ul>

返回结果数组。返回的数组需要按 id 以递增顺序排列。

&nbsp;

示例 1：

<pre>
输入：nums1 = [[1,2],[2,3],[4,5]], nums2 = [[1,4],[3,2],[4,1]]
输出：[[1,6],[2,3],[3,2],[4,6]]
解释：结果数组中包含以下元素：
- id = 1 ，对应的值等于 2 + 4 = 6 。
- id = 2 ，对应的值等于 3 。
- id = 3 ，对应的值等于 2 。
- id = 4 ，对应的值等于5 + 1 = 6 。
</pre>

示例 2：

<pre>
输入：nums1 = [[2,4],[3,6],[5,5]], nums2 = [[1,3],[4,3]]
输出：[[1,3],[2,4],[3,6],[4,3],[5,5]]
解释：不存在共同 id ，在结果数组中只需要包含每个 id 和其对应的值。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 200</code></li>
	<li><code>nums1[i].length == nums2[j].length == 2</code></li>
	<li><code>1 &lt;= idi, vali &lt;= 1000</code></li>
	<li>数组中的 id 互不相同</li>
	<li>数据均按 id 以严格递增顺序排列</li>
</ul>