1.HashMap需要使用迭代(Iterator)進(jìn)行遍歷碗硬。創(chuàng)建一個(gè)類Student瓤湘,類方法getName():
HashMap hMap = new HashMap();
Student student1 = new Student(10, "s001", "hh", 120);//實(shí)例化類
Student student2 = new Student(10, "s002", "ww", 123);
hMap.put("1", student1);//插入hashmap
hMap.put("2", student2);
if (hMap.containsKey("2"))//根據(jù)key查詢。contains(英文意思:包含)
{
System.out.println("找到了");
Student student = (Student) hMap.get("2");
System.out.println(student.getName());
} else
{
System.out.println("沒找到");
}
Iterator iterator = hMap.keySet().iterator();//迭代
while (iterator.hasNext())//是否有下一個(gè)
{
String key = iterator.next().toString();//獲取key
Student student = (Student) hMap.get(key);//獲取Value
System.out.println("遍歷:" + student.getName());
}