题解 | #字符串排序#

import java.util.*;
import java.io.*;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        try {
            Integer count = Integer.valueOf(br.readLine());
            //treeset会去重，但题目不需要去重，所以不能用哈希表，直接用数组
           /* TreeSet<String> treeSet = new TreeSet<>(new Comparator<String>() {
                @Override
                public int compare(String o1, String o2) {
                    return o1.compareTo(o2);
                }
            });*/
            List<String> list = new ArrayList<>();
            for (Integer i = 0; i < count; i++) {
                String s = br.readLine();
                list.add(s);
            }
            list.sort(new Comparator<String>() {
                @Override
                public int compare(String o1, String o2) {
                    return o1.compareTo(o2);
                }
            });
            for (String s : list) {
                System.out.println(s);
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}