README_EN.md

2363. Merge Similar Items

中文文档

Description

You are given two 2D integer arrays, items1 and items2, representing two sets of items. Each array items has the following properties:

• items[i] = [valuei, weighti] where valuei represents the value and weighti represents the weight of the ith item.
• The value of each item in items is unique.

Return a 2D integer array ret where ret[i] = [valuei, weighti], with weighti being the sum of weights of all items with value valuei.

Note: ret should be returned in ascending order by value.

 

Example 1:

Input: items1 = [[1,1],[4,5],[3,8]], items2 = [[3,1],[1,5]]
Output: [[1,6],[3,9],[4,5]]
Explanation: 
The item with value = 1 occurs in items1 with weight = 1 and in items2 with weight = 5, total weight = 1 + 5 = 6.
The item with value = 3 occurs in items1 with weight = 8 and in items2 with weight = 1, total weight = 8 + 1 = 9.
The item with value = 4 occurs in items1 with weight = 5, total weight = 5.  
Therefore, we return [[1,6],[3,9],[4,5]].

Example 2:

Input: items1 = [[1,1],[3,2],[2,3]], items2 = [[2,1],[3,2],[1,3]]
Output: [[1,4],[2,4],[3,4]]
Explanation: 
The item with value = 1 occurs in items1 with weight = 1 and in items2 with weight = 3, total weight = 1 + 3 = 4.
The item with value = 2 occurs in items1 with weight = 3 and in items2 with weight = 1, total weight = 3 + 1 = 4.
The item with value = 3 occurs in items1 with weight = 2 and in items2 with weight = 2, total weight = 2 + 2 = 4.
Therefore, we return [[1,4],[2,4],[3,4]].

Example 3:

Input: items1 = [[1,3],[2,2]], items2 = [[7,1],[2,2],[1,4]]
Output: [[1,7],[2,4],[7,1]]
Explanation:
The item with value = 1 occurs in items1 with weight = 3 and in items2 with weight = 4, total weight = 3 + 4 = 7. 
The item with value = 2 occurs in items1 with weight = 2 and in items2 with weight = 2, total weight = 2 + 2 = 4. 
The item with value = 7 occurs in items2 with weight = 1, total weight = 1.
Therefore, we return [[1,7],[2,4],[7,1]].

 

Constraints:

• 1 <= items1.length, items2.length <= 1000
• items1[i].length == items2[i].length == 2
• 1 <= valuei, weighti <= 1000
• Each valuei in items1 is unique.
• Each valuei in items2 is unique.

Solutions

Python3

class Solution:
    def mergeSimilarItems(
        self, items1: List[List[int]], items2: List[List[int]]
    ) -> List[List[int]]:
        cnt = [0] * 1010
        for v, w in chain(items1, items2):
            cnt[v] += w
        return [[i, v] for i, v in enumerate(cnt) if v]

Java

class Solution {
    public List<List<Integer>> mergeSimilarItems(int[][] items1, int[][] items2) {
        int[] cnt = new int[1010];
        for (int[] e : items1) {
            cnt[e[0]] += e[1];
        }
        for (int[] e : items2) {
            cnt[e[0]] += e[1];
        }
        List<List<Integer>> ans = new ArrayList<>();
        for (int i = 0; i < cnt.length; ++i) {
            if (cnt[i] > 0) {
                ans.add(Arrays.asList(i, cnt[i]));
            }
        }
        return ans;
    }
}

C++

class Solution {
public:
    vector<vector<int>> mergeSimilarItems(vector<vector<int>>& items1, vector<vector<int>>& items2) {
        vector<int> cnt(1010);
        for (auto& e : items1) cnt[e[0]] += e[1];
        for (auto& e : items2) cnt[e[0]] += e[1];
        vector<vector<int>> ans;
        for (int i = 0; i < cnt.size(); ++i)
            if (cnt[i]) ans.push_back({i, cnt[i]});
        return ans;
    }
};

Go

func mergeSimilarItems(items1 [][]int, items2 [][]int) [][]int {
	cnt := make([]int, 1010)
	for _, e := range items1 {
		cnt[e[0]] += e[1]
	}
	for _, e := range items2 {
		cnt[e[0]] += e[1]
	}
	ans := [][]int{}
	for i, v := range cnt {
		if v > 0 {
			ans = append(ans, []int{i, v})
		}
	}
	return ans
}

TypeScript

...