LeetCode 2570: Merge Two 2D Arrays by Summing Values Solution

Master LeetCode problem 2570 (Merge Two 2D Arrays by Summing Values), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2570. Merge Two 2D Arrays by Summing Values

Easy

Array Hash Table Two Pointers

Problem Explanation

Explanation:

To solve this problem, we can use a two-pointer approach to merge the two arrays while keeping track of the sums for each id. We will iterate over both arrays simultaneously, comparing the ids at the current positions in the arrays. Based on the comparison, we will update the sum of the current id and move the pointers accordingly. Finally, we will include any remaining ids from both arrays in the result.

Time complexity: O(N + M) where N and M are the lengths of nums1 and nums2 respectively.
Space complexity: O(N + M) for the resulting array.

Solution Code

class Solution {
    public int[][] mergeArrays(int[][] nums1, int[][] nums2) {
        List<int[]> result = new ArrayList<>();
        int i = 0, j = 0;

        while (i < nums1.length && j < nums2.length) {
            int id1 = nums1[i][0];
            int id2 = nums2[j][0];

            if (id1 == id2) {
                result.add(new int[]{id1, nums1[i][1] + nums2[j][1]});
                i++;
                j++;
            } else if (id1 < id2) {
                result.add(new int[]{id1, nums1[i][1]});
                i++;
            } else {
                result.add(new int[]{id2, nums2[j][1]});
                j++;
            }
        }

        while (i < nums1.length) {
            result.add(new int[]{nums1[i][0], nums1[i][1]});
            i++;
        }

        while (j < nums2.length) {
            result.add(new int[]{nums2[j][0], nums2[j][1]});
            j++;
        }

        return result.toArray(new int[0][0]);
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2570 (Merge Two 2D Arrays by Summing Values)?

This page provides optimized solutions for LeetCode problem 2570 (Merge Two 2D Arrays by Summing Values) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2570 (Merge Two 2D Arrays by Summing Values)?

The time complexity for LeetCode 2570 (Merge Two 2D Arrays by Summing Values) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2570 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2570 in Java, C++, or Python.

Back to LeetCode Solutions