题解 | #字符串排序#

import java.util.*;
import java.util.TreeMap;

//主要复习map的遍历方式。
//排序想到用treemap

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String inputStr = in.nextLine();

        TreeMap<String, Integer> tm = new TreeMap<String, Integer>();
        while (in.hasNext()) {
            String key = in.nextLine();
            if (tm.containsKey(key)) {
                tm.put(key, tm.get(key) + 1);
            } else {
                tm.put(key, 1);
            }
        }

        //遍历map, entry组成的set集合，entryset
        for (Map.Entry<String, Integer> entry : tm.entrySet()) {
            //可能会出现重复单词的情况，有几个就输出几个
            for (int i = 0; i < entry.getValue(); i++) {
                System.out.println(entry.getKey());
            }
        }

    }
}