Combined Item Weights
Imagine two invoices where each row contains an item value and its weight. Write a function merge_items that receives two lists of pairs, where each pair contains a value and a weight, and values do not repeat within the same list. Merge the lists by adding weights for matching values and keeping unique values as they are. Return the pairs sorted by value.
Примеры
Ввод
[[1, 1], [4, 5], [3, 8]], [[3, 1], [1, 5]]Вывод
[[1, 6], [3, 9], [4, 5]]Ввод
[[1, 1], [3, 2], [2, 3]], [[2, 1], [3, 2], [1, 3]]Вывод
[[1, 4], [2, 4], [3, 4]]Ввод
[[1, 3], [2, 2]], [[7, 1], [2, 2], [1, 4]]Вывод
[[1, 7], [2, 4], [7, 1]]Нужно реализовать
def merge_items(items1: list[list[int]], items2: list[list[int]]) -> list[list[int]]:
Теги
arrayhashmapdictsorting
Logáil isteach chun stair na n-aighneachtaí a fheiceáil
Logáil isteachLogáil isteach chun an Meantóir IS a úsáid
Logáil isteachTests12
Visible tests
Tástáil fholaithe 7
Tástáil fholaithe 8
Tástáil fholaithe 9
Tástáil fholaithe 10
Tástáil fholaithe 11
Tástáil fholaithe 12
They run when you press "Submit" — your whole solution is checked against them so you can't hard-code answers for the visible cases.
Focus radio
Paused · SomaFM · Fluid