PAT-1078 Hashing (散列表 二次探测法)
来源:互联网 发布:淘宝直播视频审核范本 编辑:程序博客网 时间:2024/06/05 18:10
The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. The hash function is defined to be "H(key) = key % TSize" where TSize is the maximum size of the hash table. Quadratic probing (with positive increments only) is used to solve the collisions.
Note that the table size is better to be prime. If the maximum size given by the user is not prime, you must re-define the table size to be the smallest prime number which is larger than the size given by the user.Input Specification:
Each input file contains one test case. For each case, the first line contains two positive numbers: MSize (<=104) and N (<=MSize) which are the user-defined table size and the number of input numbers, respectively. Then N distinct positive integers are given in the next line. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print the corresponding positions (index starts from 0) of the input numbers in one line. All the numbers in a line are separated by a space, and there must be no extra space at the end of the line. In case it is impossible to insert the number, print "-" instead.
Sample Input:
4 4
10 6 4 15
0 1 4 -
题目大意:此题给出散列表的大小msize以及要插入的数据n个,要求顺序输出每个数据在散列表中的索引。
2.用二次探测法(quadratic probing)解决碰撞,而且只考虑正增长;
#include <iostream>using namespace std;bool marked[10010];//注意9973的下一个素数是10007//判断是否是素数的函数bool is_prime(int x) {if (x < 2)return false; for (int i = 2; i * i <= x; i++) if (x % i == 0) return false; return true;}int main(void) { int msize, n, num, i; cin >> msize >> n; for (i = msize; ; i++) { if (is_prime(i)) { msize = i; break; } } for (i = 0; i < n; i++) { cin >> num; int h = num % msize;//初始散列位置int hash = h;bool flag = false;//是否散列成功 for (int k = 0; k < msize; k++) { hash = (h + k * k) % msize;//二次探测法 if (!marked[hash]) {//成功找到位置 marked[hash] = true;flag = true; break; } } if (flag)cout << hash;elsecout << "-"; if (i != n-1) cout << " "; else cout << endl; } return 0;}
阅读全文
0 0
- PAT-1078 Hashing (散列表 二次探测法)
- PAT (Advanced Level) 1078. Hashing (25) 哈希,二次探测法
- PAT--1078. Hashing(哈希二次探测)
- HashTable哈希表/散列表(线性探测和二次探测)
- hash,分离链接法,探测散列表(二次探测),再散列的代码
- PAT (Advanced Level) Practise 1078 Hashing (25)(平方探测)
- C++散列表二次探测
- 二次探测再散列散列表 源代码(数据结构)
- 1078. Hashing (25):二次探测法哈希查找
- pat甲1078. Hashing(hash+Quadratic probing 平方探测)
- 散列表(四):冲突处理的方法之开地址法(二次探测再散列的实现)
- 散列表(四):冲突处理的方法之开地址法(二次探测再散列的实现)
- 1078. Hashing (25)-PAT甲级真题(二次方探查法)
- 1078. Hashing (25)哈希二次碰撞探测
- 散列表--线性探测法
- PAT 1078 Hashing (25)
- pat 1078 Hashing
- PAT 1078 Hashing
- 深入理解JS闭包
- 学习笔记----COFF文件结构
- A. New Year Candles----模拟
- 针对分类问题的单隐层前馈神经网络模型
- 解决The SDK platform-tools version ((23)) is too old to check APIs compiled with API 23
- PAT-1078 Hashing (散列表 二次探测法)
- 返回键不退出应用(返回到桌面)
- POJ
- python学习(4)
- 5.Object类
- 毛玻璃效果
- CodeForces
- B
- 整型-文件-方法名-日期-文件拷贝-缩略图-JSON创建-PDF-HTTP-单例-抓屏-目录-ZIP-XML-Map-邮件-Array