哈希表插入和删除元素-Hashtableinsertandremoveelement

1  

Ahh, you clarified your question.

啊，你澄清了你的问题。

The answer is correct.

答案是对的。

Your solution is incorrect because when you do the insert(4,e), you're not first checking to see if that key already exists in the hash table. If it does exist, then you need to overwrite it.

您的解决方案不正确，因为当您执行insert（4，e）时，您不是首先检查哈希表中是否已存在该键。如果确实存在，则需要覆盖它。

0  

Whe you insert(15,c) and (4,a), I believe you need create a linked list to solve the collision since they have the same key(4). Then Delete(15) will delete both a and c.

当你插入（15，c）和（4，a）时，我相信你需要创建一个链表来解决碰撞，因为它们有相同的键（4）。然后删除（15）将删除a和c。