![](https://cos-cdn.shuashuati.com/pipixue-web/2020-1231-2005-12/ti_inject-812ce.png)
假定有k个关键码互为同义词,即hash函数结果相同,若采用的线性探测法把这k个关键字存入散列表中,至少要进行()次探测?If there are k key values which are synonyms of each other, which means their return values of hash function are same, if we insert these k key values into the hash table by linear probing of closed hashing, we need to probe at least () times.