LC-2570 Easy LeetCode

2570. Merge Two 2D Arrays by Summing Values

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 82% Topics: Array, Hash Table, Two Pointers

Reading material

Arrays & Hashing 12 min Two Pointers 9 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

# two pointers
class Solution(object):
    def mergeArrays(self, nums1, nums2):
        """
        :type nums1: List[List[int]]
        :type nums2: List[List[int]]
        :rtype: List[List[int]]
        """
        result = []
        i = j = 0
        while i < len(nums1) or j < len(nums2):
            if j == len(nums2) or (i < len(nums1) and nums1[i][0] < nums2[j][0]):
                if result and result[-1][0] == nums1[i][0]:
                    result[-1][1] += nums1[i][1]
                else:
                    result.append(nums1[i])
                i += 1
            else:
                if result and result[-1][0] == nums2[j][0]:
                    result[-1][1] += nums2[j][1]
                else:
                    result.append(nums2[j])
                j += 1
        return result

Solution from kamyu104/LeetCode-Solutions · MIT