KMP
kmp详解
#include<iostream>
using namespace std;
const int N=1e5+10,M=1e6+10;
int n,m;
char s[M],p[N];
int ne[N];
int main(){
cin>>n>>p+1>>m>>s+1;
for(int i=2,j=0;i<=n;i++){
while(j && p[i]!=p[j+1])j=ne[j];
if(p[i]==p[j+1])j++;
ne[i]=j;
}
for(int i=1,j=0;i<=m;i++){
while(j && s[i]!=p[j+1]) j=ne[j];
if(s[i]==p[j+1]) j++;
if(j==n){
j=ne[j];
printf("%d ",i-n);
}
}
return 0;
}
模拟散列表(拉链法)
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=100003;
int n;
int h[maxn],e[maxn],ne[maxn],idx;
void insert(int x){
int k=(x%maxn+maxn)%maxn;
e[idx]=x;
ne[idx]=h[k];
h[k]=idx++;
}
bool find(int x){
int k=(x%maxn+maxn)%maxn;
for(int i=h[k];i!=-1;i=ne[i]){
if(x==e[i])return true;
}
return false;
}
int main(){
memset(h,-1,sizeof h);
cin>>n;
while(n--){
char op[2];
int x;
scanf("%s%d",op,&x);
if(op[0]=='I')insert(x);
else {
if(find(x))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
return 0;
}
模拟散列表(开放寻址法)
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf=0x3f3f3f3f;
const int N=2e5+3;
int h[N];
int n;
int find(int x){
int k=(x%N+N)%N;
while(h[k]!=inf && h[k]!=x){
k++;
if(k==N) k=0;
}
return k;
}
int main(){
memset(h,0x3f,sizeof h);
cin>>n;
char op[2];
int x;
for(int i=0;i<n;i++){
scanf("%s%d",op,&x);
int k=find(x);
if(op[0]=='I') h[k]=x;
else {
if(h[k]==x) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
return 0;
}