1. 程式人生 > >1006 Sign In and Sign Out (25 分)

1006 Sign In and Sign Out (25 分)

1006 Sign In and Sign Out (25 分)

利用Collections中sort方法
程式碼:

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;


public class Main {
public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); Map<String,String> a = new HashMap<String,String>(); Map<String,String> b = new HashMap<String,String>(); int n = scan.nextInt(); for (int i = 0; i <
n; i++) { String s = scan.next(); String s1 = scan.next(); String s2 = scan.nextLine(); a.put(s, s1); b.put(s, s2); } List<Map.Entry<String, String>> list = new ArrayList<Map.Entry<String,String>>(a.entrySet()); Collections.sort(list, new Comparator<Map.
Entry<String, String>>() { @Override public int compare(Entry<String, String> o1, Entry<String, String> o2) { return o1.getValue().compareTo(o2.getValue()); } }); // for (Map.Entry<String, String> map:list) { // System.out.println(map.getKey()+":"+map.getValue()); // } System.out.print(list.get(0).getKey()+" "); List<Map.Entry<String, String>> list1 = new ArrayList<Map.Entry<String,String>>(b.entrySet()); Collections.sort(list1, new Comparator<Map.Entry<String, String>>() { @Override public int compare(Entry<String, String> o1, Entry<String, String> o2) { return -o1.getValue().compareTo(o2.getValue()); } }); // for (Map.Entry<String, String> map:list1) { // System.out.println(map.getKey()+":"+map.getValue()); // } System.out.println(list1.get(0).getKey()); } }