11-散列4 Hashing - Hard Version(30 分)
11-散列4 Hashing - Hard Version(30 分)
Given a hash table of size N,
we can define a hash function . Suppose that the linear probing is used to solve collisions, we can easily obtain the status
原创
2018-02-04 17:35:31 ·
543 阅读 ·
0 评论