四种Map集合的效率

import java.util.HashMap;
import java.util.Hashtable;
import java.util.LinkedHashMap;
import java.util.TreeMap;
public class xiaolv {
    public static void main(String[] args) {
        //四种Map集合的效率
        HashMap hm = new HashMap();
        TreeMap tm = new TreeMap();
        LinkedHashMap lm = new LinkedHashMap();
        Hashtable ht = new Hashtable();
        System.out.println("HashMap：");
        long start = System.currentTimeMillis();
        for (int i =0;i<99999;i++) {
            hm.put(i,i);
        }
        long end = System.currentTimeMillis();
        System.out.println(end-start+"ms");

        System.out.println("LinkedHashMap：");
        long start1 = System.currentTimeMillis();
        for (int i =0;i<99999;i++) {
            lm.put(i,i);
        }
        long end1 = System.currentTimeMillis();
        System.out.println(end1-start1+"ms");

        System.out.println("TreeMap：");
        long start2 = System.currentTimeMillis();
        for (int i =0;i<99999;i++) {
            tm.put(i,i);
        }
        long end2 = System.currentTimeMillis();
        System.out.println(end2-start2+"ms");

        System.out.println("HashTable：");
        long start3 = System.currentTimeMillis();
        for (int i =0;i<99999;i++) {
            ht.put(i,i);
        }
        long end3 = System.currentTimeMillis();
        System.out.println(end3-start3+"ms");
    }
}