题解 | #合并表记录#
合并表记录
https://www.nowcoder.com/practice/de044e89123f4a7482bd2b214a685201
import java.util.Scanner; import java.util.HashMap; import java.util.Map; import java.util.TreeMap; import java.util.Collections; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); // 注意 hasNext 和 hasNextLine 的区别 while (in.hasNextInt()) { // 注意 while 处理多个 case int a = in.nextInt(); TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>(); for (int i = 0; i < a; i++) { int c = in.nextInt(); int d = in.nextInt(); if (map.get(c) != null) { d += map.get(c); } map.put(c, d); } map.entrySet().stream().sorted(Map.Entry.comparingByKey()); map.forEach((k, v) -> {System.out.println(k + " " + v);}); } } }#刷题##刷题记录##刷题工具##刷题心得#