1.首先实现一个链表。注意链表结点的插入实现。是头插法。
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) {
Node node = first;
while (node != null) {
if (node.key.equals(key)) {
return node.value;
}
}
return null;
}
public void put(Key key, Value value) {
for (Node x = first; x != null; x = x.next) {
if (x.key.equals(key)) {
x.value = value;
return;
}
}
first = new Node(key, value, first);
}
}
/**
* 基于拉链法的散列表
*
* @author gao.mq
*
* @param <Key>
* @param <Value>
*/
public class SeparateChainingHashST<Key, Value> {
private int N; // 键值对总数
private int M; // 散列表的大小
private SequentialSearchST<Key, Value>[] st;// 存放链表对象的数组
public SeparateChainingHashST() {
this(997);
}
public SeparateChainingHashST(int M) {
// 创建M条链表
this.M = M;
st = (SequentialSearchST<Key, Value>[]) new SequentialSearchST[M];
for (int i = 0; i < M; i++) {
st[i] = new SequentialSearchST<Key, Value>();
}
}
// 计算映射在数组上的位置
private int hash(Key key) {
return (key.hashCode() & 0x7fffffff) % M;
}
public Value get(Key key) {
// 根据映射到数组上的位置找到链表
return st[hash(key)].get(key);
}
public void put(Key key, Value value) {
st[hash(key)].put(key, value);
N++;
}
}