840. 模拟散列表
题目链接https://www.acwing.com/problem/content/description/842/
题目:
思路:哈希表来存储,hash函数就是对值取模N,数组h的容量要比实际大2~3倍。N取质数,会让数分散的开些
方法一:哈希+开放寻址法
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=2e5+3,M=0x3f3f3f3f;
int h[N];
int findd(int u){
int t=(u%N+N)%N;
while(h[t]!=u&&h[t]!=M){
t++;
if(t==N)
t=0;
}
return t;
}
int main(){
int n;
cin>>n;
char op[2];
int x;
memset(h,0x3f,sizeof h);
while(n--){
scanf("%s %d",op,&x);
if(*op=='I'){
h[findd(x)]=x;
}else{
if(h[findd(x)]==M)
printf("No\n");
else
printf("Yes\n");
}
}
return 0;
}
方法二:哈希+拉链法
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=1e5+3;
int h[N],e[N],ne[N],idx;
void insertt(int u){
int t=(u%N+N)%N;
e[idx]=u;
ne[idx]=h[t];
h[t]=idx++;
}
bool findd(int u){
int t=(u%N+N)%N;
for(int i=h[t];i!=-1;i=ne[i]){
if(e[i]==u)
return true;
}
return false;
}
int main(){
int n;
memset(h,-1,sizeof h);
cin>>n;
char op[2];
int x;
while(n--){
scanf("%s %d",op,&x);
if(!strcmp(op,"I")){
insertt(x);
}else{
if(findd(x)) puts("Yes");
else puts("No");
}
}
return 0;
}