Skip to content

Commit ab53998

Browse files
add 2363
1 parent e04257b commit ab53998

File tree

2 files changed

+26
-0
lines changed

2 files changed

+26
-0
lines changed

README.md

+1
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
11+
| 2363 |[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2363.java) || Easy ||
1112
| 2357 |[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2357.java) || Easy ||
1213
| 2352 |[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2352.java) || Medium ||
1314
| 2351 |[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2351.java) || Easy ||
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.ArrayList;
4+
import java.util.Arrays;
5+
import java.util.List;
6+
import java.util.TreeMap;
7+
8+
public class _2363 {
9+
public static class Solution1 {
10+
public List<List<Integer>> mergeSimilarItems(int[][] items1, int[][] items2) {
11+
List<List<Integer>> result = new ArrayList<>();
12+
TreeMap<Integer, Integer> map = new TreeMap<>();
13+
for (int[] item : items1) {
14+
map.put(item[0], map.getOrDefault(item[0], 0) + item[1]);
15+
}
16+
for (int[] item : items2) {
17+
map.put(item[0], map.getOrDefault(item[0], 0) + item[1]);
18+
}
19+
for (int key : map.keySet()) {
20+
result.add(new ArrayList<>(Arrays.asList(key, map.get(key))));
21+
}
22+
return result;
23+
}
24+
}
25+
}

0 commit comments

Comments
 (0)