1078. Hashing

Hashing

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

Sample Output:

0 1 4 -

题意

给定hash表的最大容量和需要hash的n个数,利用正向的平方探查法输出每个数在hash表中对应的下标,如果不存在则输出’-’。如果给的最大容量不是素数,则在找到比它大的最小素数作为新的最大容量。

思路

考查平方探查法,其主要公式为
H ( k e y ) &ThickSpace; = &ThickSpace; ( k e y &ThickSpace; % &ThickSpace; m a x S i z e &ThickSpace; + &ThickSpace; i 2 ) &ThickSpace; % &ThickSpace; m a x S i z e 0 ≤ i ≤ m a x S i z e − 1 H(key) \; = \; (key \; \% \; maxSize \; + \; i^2) \; \% \; maxSize \quad 0 \le i \le maxSize - 1 H(key)=(key%maxSize+i2)%maxSize0imaxSize1
H(key)为应插入的下标,如果已被占用,则增加i的值计算新的下标。如果i已经达到hash表最大容量,说明无法找到位置。


代码实现

#include <cstdio>
 
const int maxn = 10001;
bool hashTable[maxn] = {false};
int msize, n;
 
bool isPrime(int n)
{
    if (n == 1)         // 特殊情况不要忘了处理
        return false;
 
    for (int i = 2; i * i <= n; i++)
        if (n % i == 0)
            return false;
 
    return true;
}
 
int qProbing(int x)
{
    int index;
    for (int i = 0; i < msize; i++)
    {
        index = (x % msize + i * i) % msize;    // 寻找插入位置
        if (!hashTable[index])      // 可以插入
        {
            hashTable[index] = true;
            return index;
        }
    }
    return -1;      // 插入失败
}
 
int main()
{
    int x;
 
    scanf("%d %d", &msize, &n);
    while (!isPrime(msize))     // 将最大容量调整至素数
        msize++;
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &x);
        if (i > 0)
            printf(" ");
        int index = qProbing(x);
        if (index == -1)
            printf("-");
        else
            printf("%d", index);
    }
 
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值