|
| 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