符号表的顺序查找(基于无序链表) 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); } }