采用除留余数法构造哈希表，要求装载因子不超过0.7，线性探测再散列解决冲突，输出哈希表；任意输入关键字，判断是否在哈希表中，若存在显示查找成功并显示查找次数；若不存在，插入到哈希表中，再显示哈希表中的关键字序列。(The hash table is constructed by using the method of removing and reserving remainder. The loading factor is required to be no more than 0.7. The conflict is solved by linear detection and hashing, and the hash table is output. Any key words are input to determine whether they are in the hash table. If there is a successful search and the number of searches are displayed. If not, the key sequence in the hash table is inserted and displayed.)