1、HashMap无序
2、TreeMap自然排序
3、LinkedHashMap按存放顺序排序
// TreeMap键自然排序,键为字符串
Map<String, String> treemap = new TreeMap<>();
treemap.put("1", "1");
treemap.put("2", "2");
treemap.put("11", "3");
treemap.put("12", "4");
treemap.put("21", "5");
// 输出值
for (String key : treemap.keySet()) {
System.out.print(treemap.get(key));// 结果:13425
}
System.out.println();
// TreeMap键自然排序,键为Number
Map<Integer, String> treemap2 = new TreeMap<>();
treemap2.put(1, "1");
treemap2.put(11, "3");
treemap2.put(12, "4");
treemap2.put(2, "2");
treemap2.put(21, "5");
// 输出值
for (Integer key : treemap2.keySet()) {
System.out.print(treemap2.get(key));// 结果:12345
}
System.out.println();
// LinkedHashMap键按存放顺序排序
Map<Integer, String> linkmap = new LinkedHashMap<>();
linkmap.put(21, "5");
linkmap.put(12, "4");
linkmap.put(11, "3");
linkmap.put(2, "2");
linkmap.put(1, "1");
// 输出值
for (Integer key : linkmap.keySet()) {
System.out.print(linkmap.get(key));// 结果:54321
}