HashMap的使用(简称散列表)

最新推荐文章于 2024-07-30 13:42:46 发布

weixin_34242658

最新推荐文章于 2024-07-30 13:42:46 发布

阅读量96

点赞数

文章标签：数据结构与算法 python java

原文链接：https://my.oschina.net/u/2511906/blog/1503401

版权

2019独角兽企业重金招聘Python工程师标准>>>

import java.util.*; public class LinkList { public static void main(String args[]){

   Student s1=new Student("1","23"),	    
   s2=new Student("32","22"),
   s3=new Student("3","2323"),
   s4=new Student("4","233");
    
   HashMap<String,Student> table=new HashMap<String,Student>();
   table.put(s1.core,s1);
   table.put(s2.core,s2);
   table.put(s3.core,s3);
   table.put(s4.core,s4);
   

    String key="1";
   if(table.containsKey(key)){
	   System.out.println("ok");
	   System.out.println(table.get(key).name+"友好");
   }
   
   Collection<Student> colletion=table.values();                                     
   Iterator<Student> iter=colletion.iterator();
   
   while(iter.hasNext()){
	   Student stu=iter.next();
	   System.out.println(stu.name+":"+stu.core);
	   
   }

} }

转载于:https://my.oschina.net/u/2511906/blog/1503401