Map(4)--HashMap

（一）hashMap的简单应用：

public static void main(String[] args) {
    HashMap<student, String> hm =new HashMap<student, String>();
    hm.put(new student("张三",23), "北京");
    hm.put(new student("张三",23), "上海");
    hm.put(new student("李四",24), "广州");
    hm.put(new student("王五",25), "深圳");

    System.out.println(hm); //需要重写student类中的hashCode()和equals()方法
    }

输出结果：

{student [age=23, name=张三]=上海,    
 student [age=24, name=李四]=广州,    
 student [age=25, name=王五]=深圳}

（二）HashMap的自身嵌套:

public static void main(String[] args) {
    HashMap<student, String> hm1=new HashMap<student, String>();
    hm1.put(new student("张三",23), "北京");
    hm1.put(new student("李四",24), "北京");
    hm1.put(new student("王五",24), "上海");
    hm1.put(new student("赵六",26), "深圳");

    HashMap<student, String> hm2=new HashMap<student, String>();
    hm2.put(new student("张三2",23), "北京");
    hm2.put(new student("李四2",24), "北京");
    hm2.put(new student("王五2",24), "上海");
    hm2.put(new student("赵六2",26), "深圳");

    HashMap<HashMap<student, String>, String> hm=new HashMap<HashMap<student, String>, String>();
    hm.put(hm1, "1111");
    hm.put(hm2, "2222");

    //遍历双列集合
    for(HashMap<student, String> h:hm.keySet()){
        String value=hm.get(h);
        //遍历健的双列集合对象
        for(student key:h.keySet()){//获取集合中所有的学生
            String value2=h.get(key);

            System.out.println(key+"="+value2+"="+value);
        }
    }

    System.out.println();
}

输出结果：

student [age=23, name=张三]=北京=1111
student [age=24, name=李四]=北京=1111
student [age=26, name=赵六]=深圳=1111
student [age=24, name=王五]=上海=1111
student [age=23, name=张三2]=北京=2222
student [age=24, name=李四2]=北京=2222
student [age=26, name=赵六2]=深圳=2222
student [age=24, name=王五2]=上海=2222

（三）hashMap和Hashtable的关系
共同点： 底层都是哈希算法，都是双列集合
区别：
1，hashMap是线程不安全的，效率高，JDK1.2版本
hashtable是线程安全的，效率低，JDK1.0版本
2，hashMap可以存储null健和null值
hashtable不可以存储null健和null值