Java 中的 Map 的区别: HashMap, LinkedHashMap, TreeMap

Map是用来保存2个元素的对应关系的，分别是key和value，key唯一。Java 自带的三个实现使用有下面的区别。

HashMap 不能保证取里面元素时的顺序

LinkedHashMap 可以保证按添加的顺序去取

TreeMap 可以保证按 key 的排序顺序去取(key 需要实现 Comparable, 否则会报错 cannot be cast to java.lang.Comparable)

例子如下：

import java.util.Map;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.TreeMap;

public class TestJavaUtilMap {
    public static void main( String[] args ) {
        Map<String, String> hashMap = new HashMap<String, String>();
        hashMap.put("b", "ball");
        hashMap.put("a", "about");
        hashMap.put("c", "clear");
        hashMap.put("1", "one");

        Map<String, String> linkedHashMap = new LinkedHashMap<String, String>();
        linkedHashMap.put("b", "ball");
        linkedHashMap.put("a", "about");
        linkedHashMap.put("c", "clear");
        linkedHashMap.put("1", "one");

        Map<String, String> treeMap = new TreeMap<String, String>();
        treeMap.put("b", "ball");
        treeMap.put("a", "about");
        treeMap.put("c", "clear");
        treeMap.put("1", "one");

        System.out.println("==== HashMap ====");
        for(Map.Entry<String, String> entry : hashMap.entrySet()){
            System.out.println(entry.getKey() + ":" + entry.getValue());
        }

        System.out.println("==== LinkedHashMap ====");
        for(Map.Entry<String, String> entry : linkedHashMap.entrySet()){
            System.out.println(entry.getKey() + ":" + entry.getValue());
        }

        System.out.println("==== TreeMap ====");
        for(Map.Entry<String, String> entry : treeMap.entrySet()){
            System.out.println(entry.getKey() + ":" + entry.getValue());
        }
    }

}

运行输出：

==== HashMap ====
a:about
1:one
b:ball
c:clear
==== LinkedHashMap ====
b:ball
a:about
c:clear
1:one
==== TreeMap ====
1:one
a:about
b:ball
c:clear