西南科技大学SWUST OJ 数据结构 查找排序相关题解 查找排序.zip

//哈希表 #include<stdio.h> #include<stdlib.h> int len; //哈希表大小 int n,m; //数据量及需要查找的数 int count; int ha[30]; //哈希表最简单的定义 int search() { int j; j=m%13; count=1; while(ha[j]!=m&&count<=len) { count++; j=(j+1)%13; } if(count>len) return -1; else return j; } void creat() { int i,j,k; scanf("%d%d",&len,&n); for(i=0;i<len;i++) { ha[i]=-1; } for(i=0;i<n;i++) { scanf("%d",&k); j=k%13; while(ha[j]!=-1) j=(j+1)%13; ha[j]=k; } scanf("%d",&m); i=search(); if(i>=0) { printf("%d,",i); printf("%d",count); } else printf("-1"); } int main() { creat(); search(); return 0; } //*************** #include<cstdio> #include<cstdlib> #include<iostream> using namespace std; int len,n,a[100],m,count=1; typedef struct { int key; }hashtable; hashtable ha[100]; int search() { int j; j=m%13; if(ha[j].key==m) return j; else if(ha[j].key!=m) { j=(j+1)%13; while(ha[j].key!=m&&count<=len) { count++; j=(j+1)%13; } if(count>len) return -1; else return j; } } void insert(int k) { int j; j=k%13; while(ha[j].key!=-1) { j=(j+1)%13; } ha[j].key=k; } void creat() { int i,k; for(i=0;i<len;i++) { ha[i].key=-1; } for(i=0;i<n;i++) { insert(a[i]); } k=search(); if(k>0) { printf("%d,",k); printf("%d",count); } else printf("-1"); } void read() { cin>>len>>n; int i; for(i=0;i<n;i++) { cin>>a[i]; } cin>>m; creat(); } int main() { read(); return 0; } //***code2 #include<iostream> using namespace std; typedef struct Data { int num; int n; }data; int n; data hash[100]; void build() { int m; int i; cin>>n; for(i=0;i<n;i++) hash[i].n=0; cin>>m; for(i=0;i<m;i++) { int e,t,e_; int mid=1; cin>>e; t=e%n; e_=e; while(hash[t].n!=0) { mid++; e_++; t=(e_+1)%n; } hash[t].num=e; hash[t].n=mid; } } int deal() { int e; cin>>e; int e_; e_=e; while(e_%n!=e%n-1) { if(hash[e_%n].num==e) { cout<<e_%n<<","<<hash[e_%n].n; return 0; } else e_++; } return -1; } int main(void) { build(); if(deal()==-1) cout<<-1; return 0; } //***code3 #include<stdio.h> int hash[100], n; int main() { int key,k, i, j,t; char ch; scanf("%d",&n); while (1) { scanf("%d%c", &key,&ch); t = key%n; while (hash[t] != 0) t = (t + 1) % n; hash[t] = key; if (ch != ' ') break; } scanf("%d",&k); for (i = k%n, j=0; j<n; j++, i++) { if (hash[i] == k) { printf("%d,%d",i,j+1); break; } } if (j == n) printf("-1"); return 0; } //***code4 #include<cstdio> #include<cstring> struct node { int key; int count; }Hash[111]; void InsertHT(int k,int p) { int i,adr; adr=k%p; if(Hash[adr].key == -1) { Hash[adr].key=k; Hash[adr].count=1; } else { i=1; while(Hash[adr].key != -1) { adr=(adr+1)%p; i++; } Hash[adr].key=k; Hash[adr].count=i; } } int SerchHt(int k,int p) { int i=0,adr; adr=k%p; while(Hash[adr].key != -1 && Hash[adr].key != k) { i++; adr=(adr+1)%p; } if(Hash[adr].key == k) return adr; else return -1; } int main() { int n; scanf("%d",&n); int t; memset(Hash,-1,sizeof(Hash)); char ch; while(scanf("%d%c",&t,&ch)) { InsertHT(t,n); if(ch != ' ') break; } scanf("%d",&t); int ans=SerchHt(t,n); if(ans == -1) printf("-1"); else printf("%d，%d",ans,Hash[ans].count); return 0; }