Skip to content

Commit a2ffa09

Browse files
solves #2363: Merge Similar Items in java
1 parent fe3950a commit a2ffa09

File tree

2 files changed

+43
-1
lines changed

2 files changed

+43
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -757,7 +757,7 @@
757757
| 2351 | [First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice) | [![Java](assets/java.png)](src/FirstLetterToAppearTwice.java) | |
758758
| 2357 | [Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts) | [![Java](assets/java.png)](src/MakeArrayZeroBySubtractingEqualAmounts.java) | |
759759
| 2360 | [Longest Cycle in a Graph](https://leetcode.com/problems/longest-cycle-in-a-graph) | [![Python](assets/python.png)](python/longest_cycle_in_graph.py) | |
760-
| 2363 | [Merge Similar Items](https://leetcode.com/problems/merge-similar-items) | | |
760+
| 2363 | [Merge Similar Items](https://leetcode.com/problems/merge-similar-items) | [![Java](assets/java.png)](src/MergeSimilarItems.java) | |
761761
| 2367 | [Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets) | | |
762762
| 2373 | [Largest Local Values in a Matrix](https://leetcode.com/problems/largest-local-values-in-a-matrix) | | |
763763
| 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks) | | |

src/MergeSimilarItems.java

+42
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
// https://leetcode.com/problems/merge-similar-items
2+
// T: O(Nlog(N))
3+
// S: O(N)
4+
5+
import java.util.ArrayList;
6+
import java.util.Comparator;
7+
import java.util.HashMap;
8+
import java.util.List;
9+
import java.util.Map;
10+
11+
public class MergeSimilarItems {
12+
public List<List<Integer>> mergeSimilarItems(int[][] items1, int[][] items2) {
13+
final Map<Integer, Integer> valueToWeight = getValueToWeightMapping(items1);
14+
for (int[] row : items2) {
15+
if (valueToWeight.containsKey(row[0])) {
16+
valueToWeight.put(row[0], valueToWeight.get(row[0]) + row[1]);
17+
} else {
18+
valueToWeight.put(row[0], row[1]);
19+
}
20+
}
21+
22+
final List<List<Integer>> list = toList(valueToWeight);
23+
list.sort(Comparator.comparingInt(a -> a.get(0)));
24+
return list;
25+
}
26+
27+
private List<List<Integer>> toList(Map<Integer, Integer> mapping) {
28+
final List<List<Integer>> result = new ArrayList<>();
29+
for (Map.Entry<Integer, Integer> entry : mapping.entrySet()) {
30+
result.add(List.of(entry.getKey(), entry.getValue()));
31+
}
32+
return result;
33+
}
34+
35+
private Map<Integer, Integer> getValueToWeightMapping(int[][] array) {
36+
final Map<Integer, Integer> result = new HashMap<>();
37+
for (int[] row : array) {
38+
result.put(row[0], row[1]);
39+
}
40+
return result;
41+
}
42+
}

0 commit comments

Comments
 (0)