【数据结构与算法】分离链接法散列表的Java实现

SeparateChainingHashTable核心功能设计

• boolean insert(x) → Insert x.
• boolean remove(x) → Remove x.
• boolean contains(x) → Return true if x is present.
• void makeEmpty() → Remove all items.

SeparateChainingHashTable编程实现

import java.util.LinkedList;
import java.util.List;

/**
 * Separate chaining table implementation of hash tables.
 * Note that all "matching" is based on the equals method.
 * @author BlankSpace
 */
public