HashMap,LinkedHashMap,TreeMap应用简介
????? + e.getValue());
?? }
}
// 有序(默认排序，不能指定)
public static void hasOrder() {
?? System.out.println("------有序（但是按默认顺充，不能指定）------");
?? Map map = new TreeMap();
?? map.put("F", "Level F");
?? map.put("7", "Level 1");
?? map.put("8", "Level 2");
?? map.put("4", "Level 3");
?? map.put("4", "Level 4");
?? map.put("Q", "Level Q");
?? map.put("E", "Level E");
?? Iterator it = map.entrySet().iterator();
?? while (it.hasNext()) {
??? Map.Entry e = (Map.Entry) it.next();
??? System.out.println("Key: " + e.getKey() + ";?? Value: "
????? + e.getValue());
?? }
}
public static void likedHashMap() {
?? System.out.println("------有序（根据输入的顺序输出）------");
?? Map map = new LinkedHashMap();
?? map.put("F", "Level F");
?? map.put("7", "Level 1");
?? map.put("8", "Level 2");
?? map.put("4", "Level 3");
?? map.put("4", "Level 4");
?? map.put("Q", "Level Q");
?? map.put("E", "Level E");
?? Iterator it = map.entrySet().iterator();
?? while (it.hasNext()) {
??? Map.Entry e = (Map.Entry) it.next();
??? System.out.println("Key: " + e.getKey() + ";?? Value: "
????? + e.getValue());
?? }
}
}
输出结果：
------无序（随机输出------
Key: 3;?? Value: Level 3
Key: F;?? Value: Level F
Key: 2;?? Value: Level 2
Key: 4;?? Value: Level 4
Key: Q;?? Value: Level Q
Key: 1;?? Value: Level 1
------有序（但是按默认顺充，不能指定）------
Key: 4;?? Value: Level 4
Key: 7;?? Value: Level 1
Key: 8;?? Value: Level 2
Key: E;?? Value: Level E
Key: F;?? Value: Level F
Key: Q;?? Value: Level Q
------有序（根据输入的顺序输出）------
Key: F;?? Value: Level F
Key: 7;?? Value: Level 1
Key: 8;?? Value: Level 2
Key: 4;?? Value: Level 4
Key: Q;?? Value: Level Q
Key: E;?? Value: Level E
