11-散列4 Hashing - Hard Version（浙大数据结构PTA习题）

最新推荐文章于 2025-11-30 16:20:41 发布

原创

最新推荐文章于 2025-11-30 16:20:41 发布 · 734 阅读

6 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构 #哈希算法 #散列表

11-散列4 Hashing - Hard Version

分数 30 作者何钦铭单位浙江大学

Question:

Given a hash table of size N, we can define a hash function H(x)=x%N. Suppose that the linear probing is used to solve collisions, we can easily obtain the status of the hash table with a given sequence of input numbers.

However, now you are asked to solve the reversed problem: reconstruct the input sequence from the given status of the hash table. Whenever there are multiple choices, the smallest number is always taken.

Input Specification:

Each input file contains one test case. For each test case, the first line contains a positive integer N (≤1000), which is the size of the hash table. The next line contains N integers, separated by a space. A negative integer represents an empty cell in the hash table. It is guaranteed that all the non-negative integers are distinct in the table.