//散列法
#include<stdio.h>
#include<cstring>
using namespace std;
#define m 1046527
#define nil (-1)
#define l 14
char H[m][l];
//将字符转换成数值
int getchar(char ch)
{
if(ch=='A')
return 1;
else if(ch=='C')
return 2;
else if(ch=='G')
return 3;
else if(ch=='T')
return 4;
}
//将字符串转换为数值并生成key
long long getkey(char str[])
{
long long sum = 0, p = 1;
for(int i = 0; i < strlen(str); i ++)
{
sum += p*(getchar(str[i]));
p *= 5;
}
return sum;
}
int h1(int key)
{
return key%m;
}
int h2(int key)
{
return 1 + (key % (M-1));
}
int find(char str[])
{
long long key,i,h;
key = getkey(str);
for(i = 0;;i ++)
{
h = (h1(key) + i * h2(key)) % m;
if(strcmp(H[h],str)==0)
return 1;
else if(strlen(H[h])==0)
return 0;
}
return 0;
}
int insert(char str[])
{
long long key,i,h;
}
int main()
{
int n,h;
char str[l],com[9];
for(int i = 0; i < n; i++)
scanf("%s %s",com,str);
if(com[0]=='i')
insert(str);
else
{
if(find(str))
printf("YES\n");
else
printf("NO\n");
}
}
散列法-不全
猜你喜欢
转载自blog.csdn.net/qiulianshaonv_wjm/article/details/82468370
今日推荐
周排行