//O（n）
public void Add(E e)
{
if (!list.Contains(e))
{
list.AddFirst(e);
}
}
public void Remove(Key key)
{
LinkedList1 <Key> list = hashtable[Hash(key)];
if (list.Contains(key))
{
list.Remove(key);
N--;
}
}
public void Add(Key key)
{
LinkedList1 <Key> list = hashtable[Hash(key)];
if (list.Contains(key))
{
return;
}
else
{
list.AddFirst(key);
N++;
}
}
public bool Contains(Key key)
{
LinkedList1 <Key> list = hashtable[Hash(key)];
return(list.Contains(key));
}
