1．定义哈希表数据结构。

2．除留余数法做为哈希函数、

　　H(key) = key P

　　用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。

3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define the hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key　P re-hashing with linear probing method of conflict resolution, write functions, making the hash table implementation process, and output the hash table. 3. Write a function, seeking to find the average successful search length (ASL).