原书出处
Introduction to Algorithms, Fourth Edition
11 第11章 散列表
T. Deletion from an open-address hash table is tricky. When you delete a key from slot q,
it would be a mistake to mark that slot as empty by simply storing NIL in it.
If you did, you might be unable to retrieve any key k for which slot q was probed and fou
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter011.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea