符号表的顺序查找(基于无序链表)
public class SequentialSearchST <Key,Value> {
private Node first;
private class Node{
Key key;
Value value;
Node next;
public Node(Key key,Value value,Node next){
this.key=key;
this.value=value;
this.next=next;
}
}
public Value get(Key key){
for(Node temp = first;temp!=null;temp=temp.next){
if(temp.key.equals(key)){
return temp.value;
}
}
return null;
}
public void put(Key key,Value value){
for(Node temp = first;temp!=null;temp=temp.next){
if(temp.key.equals(key)){
temp.value=value;
return;
}
}
first = new Node(key,value,first);
}
}