Hash table acwing 840 Simulated hash table

Hashtable AcWing 840. Simulation hash table

Original link

AcWing 840. Simulation hash table

Algorithm tags

Hashtable

Ideas

Zipper method

Open addressing

Code

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 100003;
int a[N], e[N], h[N], ne[N], idx;
int s;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
//  Head insertion   Insert the data into the corresponding hash The value is k Of hash In the table 
void insert(int x){
    // Ensure that negative numbers can also be mapped to hash In the table   The modulo number is a prime number   Conflicts can be minimized 
    int k=(x%N+N)%N;
    e[idx]=x;
    ne[idx]=h[k];
    h[k]=idx++;
}
bool find(int x){
    int k=(x%N+N)%N;
    for(int i=h[k]; i!=-1; i=ne[i]){
        if(e[i]==x){
            return true;
        }
    }
    return false;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    memset(h, -1, sizeof h);
    int n=read();
    while(n--){
        char op[2];
        scanf("%s", op);
        int x=read();
        if(op[0]=='I'){
            insert(x);
        }else{
            if(find(x)){
                puts("Yes");
            }else{
                puts("No");
            }
            
        }
    }
    return 0;
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support