题解 | #合并表记录#
合并表记录
http://www.nowcoder.com/practice/de044e89123f4a7482bd2b214a685201
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int number = scanner.nextInt();
TreeMap<Integer, Integer> treeMap = new TreeMap<>();
for (int i = 0; i < number; i++) {
int key = scanner.nextInt();
if (treeMap.containsKey(key)) {
treeMap.put(key, scanner.nextInt() + treeMap.get(key));
} else {
treeMap.put(key, scanner.nextInt());
}
}
for (Map.Entry<Integer, Integer> next : treeMap.entrySet()) {
System.out.println(next.getKey() + " " + next.getValue());
}
}
}
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int number = scanner.nextInt();
TreeMap<Integer, Integer> treeMap = new TreeMap<>();
for (int i = 0; i < number; i++) {
int key = scanner.nextInt();
if (treeMap.containsKey(key)) {
treeMap.put(key, scanner.nextInt() + treeMap.get(key));
} else {
treeMap.put(key, scanner.nextInt());
}
}
for (Map.Entry<Integer, Integer> next : treeMap.entrySet()) {
System.out.println(next.getKey() + " " + next.getValue());
}
}
}