LeetCode 2363: Merge Similar Items Solution

Master LeetCode problem 2363 (Merge Similar Items), 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.

2363. Merge Similar Items

Easy

Array Hash Table Sorting Ordered Set

Problem Explanation

Explanation

To solve this problem, we need to iterate through both arrays items1 and items2, combine items with the same value, and calculate the total weight for each unique value. We can achieve this by using a HashMap to store the value as the key and the total weight as the value. After iterating through both arrays, we can construct the final result array by iterating through the HashMap and adding the key-value pairs to the result.

Algorithm:
1. Create a HashMap map to store the value as the key and the total weight as the value.
2. Iterate through items1 and items2 and update the total weight for each value in the map.
3. Construct the final result array by iterating through the HashMap and adding key-value pairs to the result.
Time Complexity: O(n), where n is the total number of items in both arrays.
Space Complexity: O(n), to store the unique values and their total weights.

Solution Code

import java.util.*;

class Solution {
    public int[][] mergeSimilarItems(int[][] items1, int[][] items2) {
        Map<Integer, Integer> map = new HashMap<>();
        
        for (int[] item : items1) {
            map.put(item[0], map.getOrDefault(item[0], 0) + item[1]);
        }
        
        for (int[] item : items2) {
            map.put(item[0], map.getOrDefault(item[0], 0) + item[1]);
        }
        
        int[][] result = new int[map.size()][2];
        int index = 0;
        
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            result[index][0] = entry.getKey();
            result[index][1] = entry.getValue();
            index++;
        }
        
        Arrays.sort(result, (a, b) -> a[0] - b[0]);
        
        return result;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2363 (Merge Similar Items)?

This page provides optimized solutions for LeetCode problem 2363 (Merge Similar Items) 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 2363 (Merge Similar Items)?

The time complexity for LeetCode 2363 (Merge Similar Items) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2363 on DevExCode?

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

Back to LeetCode Solutions