HashTable
哈希表是一种数据结构,提供了快速的插入操作和查找操作,具体的是基于数组来实现的HashTable中有一个内部类Entry,用来保存单元数据,我们用来构建哈希表的每一个数据都是一个Entry实例。查找方法的效率高于数组等。
public class hashTable {
public static void main(String[] args) {
// Hashtable<String, Integer> number=new Hashtable<String,Integer>();//
// number.put("one", 1);
// number.put("two", 2);
// number.put("three", 3);
// number.put("four", 4);
// number.put("five", 5);
// int n=number.get("one");
// int nn=number.get("two");
//
// System.out.println(n);
// System.out.println(nn);
Hashtable<String ,Person> person=new Hashtable<String ,Person>();
Person p1=new Person(11,1111,"jack1");
Person p2=new Person(22,2222,"jack2");
Person p3=new Person(33,3333,"jack3");
person.put("one", p1);
person.put("two", p2);
person.put("three", p3);
System.out.println(person.get("one").getId());
}
}
public class Person {
private int id;
private String name;
private int age;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public Person(int id,int age,String name){
this.id=id;
this.name=name;
this.age=age;
}
}