Java 集合框架-HashMap

一、整体代码

        HashMapDemo.java

import java.util.*;

class Student 
{

    private String name;
    private int age;
    Student(String name,int age)
    {
        this.name = name;
        this.age = age;
    }
    public int hashCode()
    {
        return name.hashCode()+age*34;
    }
    public boolean equals(Object obj)
    {
        if(!(obj instanceof Student))
        throw new ClassCastException("");
        Student s = (Student)obj;
        return this.name.equals(s.name) && this.age==s.age;
    }
    public String getName()
    {
        return name;
    }
    public int getAge()
    {
        return age;
    }
    public String toString()
    {
        return name+":"+age;
    }

}

public class  HashMapDemo
{
    public static void main(String[] args) 
    {
        HashMap<Student,String> hm = new HashMap<Student,String>();
        hm.put(new Student("lisi1",21),"beijing");
        hm.put(new Student("lisi1",21),"wuhan");
        hm.put(new Student("lisi2",22),"shanghai");
        hm.put(new Student("lisi3",23),"nanjing");
        hm.put(new Student("lisi4",24),"wuhan");
        Set<Student> keySet = hm.keySet();
        Iterator<Student> it = keySet.iterator();
        while(it.hasNext())
        {
            Student stu = it.next();
            String addr = hm.get(stu);
        }
        Set<Map.Entry<Student,String>> entrySet = hm.entrySet();
        Iterator<Map.Entry<Student,String>> iter = entrySet.iterator();
        while(iter.hasNext())
        {
            Map.Entry<Student,String> me = iter.next();
            Student stu = me.getKey();
            String addr = me.getValue();
            System.out.println(stu+"........."+addr);
        }
    }

}

二、解释

       HashMap存放键值对，判断键是否重复的依据是hasCode和equals。

   

   代码地址：https://github.com/jltxgcy/Demo