leetcode/problems/2570-go/main.go at main · emfomy/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
// Source: https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values
// Title: Merge Two 2D Arrays by Summing Values
// Difficulty: Easy
// Author: Mu Yang <http://muyang.pro>

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// You are given two **2D** integer arrays `nums1` and `nums2.`
//
// - `nums1[i] = [id_i, val_i]`indicate that the number with the id `id_i` has a value equal to `val_i`.
// - `nums2[i] = [id_i, val_i]`indicate that the number with the id `id_i` has a value equal to `val_i`.
//
// 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:
//
// - Only ids that appear in at least one of the two arrays should be included in the resulting array.
// - 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 `0`.
//
// Return the resulting array. The returned array must be sorted in ascending order by id.
//
// **Example 1:**
//
// ```
// 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.
// ```
//
// **Example 2:**
//
// ```
// 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.
// ```
//
// **Constraints:**
//
// - `1 <= nums1.length, nums2.length <= 200`
// - `nums1[i].length == nums2[j].length == 2`
// - `1 <= id_i, val_i <= 1000`
// - Both arrays contain unique ids.
// - Both arrays are instrictly ascending order by id.
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

package main

func mergeArrays(nums1 [][]int, nums2 [][]int) [][]int {
	n1, n2 := len(nums1), len(nums2)

	res := make([][]int, 0, n1+n2)

	i1, i2 := 0, 0
	for i1 < n1 && i2 < n2 {
		if nums1[i1][0] < nums2[i2][0] {
			res = append(res, nums1[i1])
			i1++
		} else if nums1[i1][0] > nums2[i2][0] {
			res = append(res, nums2[i2])
			i2++
		} else {
			nums1[i1][1] += nums2[i2][1]
			res = append(res, nums1[i1])
			i1++
			i2++
		}
	}

	res = append(res, nums1[i1:]...)
	res = append(res, nums2[i2:]...)

	return res
}