学步园

1、用数组

#include <stdio.h><br /> #define N 4</p> <p>typedef int datatype;<br /> typedef struct<br /> {<br /> datatype key;<br /> }Hretype;</p> <p>int LHashsearch(Hretype HT[N], datatype k)<br /> {<br /> int addr,i=0;<br /> addr = k % N;<br /> while(i<N && HT[addr].key != -1 && HT[addr].key != k)<br /> {<br /> i++;<br /> addr = (addr+1)%N;<br /> }<br /> if(i == N)<br /> return -1; //表溢出<br /> else<br /> return addr;<br /> }</p> <p>int LHinsert(Hretype HT[N], Hretype R)<br /> {</p> <p> int addr;<br /> addr = LHashsearch(HT, R.key);</p> <p> if(addr==-1 || HT[addr].key == R.key)<br /> {<br /> return 1;<br /> }<br /> else<br /> {<br /> HT[addr] = R;<br /> return 0;<br /> }<br /> }</p> <p>int main()<br /> {<br /> Hretype R[6];<br /> Hretype HT[N];</p> <p> for(int i=0;i<N;i++)<br /> HT[i].key = -1;</p> <p> for(i=0;i<6;i++)<br /> R[i].key = i;</p> <p> for(i=0;i<6;i++)<br /> {<br /> int value = LHinsert(HT,R[i]);<br /> if(value)<br /> printf("表溢出或记录已存在!/n");<br /> else<br /> {<br /> printf("插入成功!/n");<br /> }<br /> }<br /> return 0;<br /> } 

2、用链表

#include <stdio.h><br /> #include <stdlib.h><br /> #define N 4</p> <p>typedef int datatype;</p> <p>typedef struct node<br /> {<br /> datatype key;<br /> struct node *next;<br /> }Renode;</p> <p>Renode *LinkHsearch(Renode *HT[N], datatype k)<br /> {<br /> Renode *p;<br /> int addr = k % N;<br /> p = HT[addr];</p> <p> while(p && p->key !=k)<br /> p = p->next;</p> <p> return p;<br /> }</p> <p>void LinkHinsert(Renode *HT[N], Renode *S)<br /> {<br /> int addr;<br /> Renode *p;<br /> p = LinkHsearch(HT,S->key);<br /> if(p)<br /> {<br /> printf("记录已存在/n");<br /> free(S);<br /> }<br /> else<br /> {<br /> addr = S->key % N;<br /> S->next = HT[addr];<br /> HT[addr] = S;<br /> printf("已插入/n");<br /> }<br /> }</p> <p>int main()<br /> {<br /> Renode *HT[N];</p> <p> //指针数组初始化<br /> for(int i=0;i<N;i++)<br /> HT[i] = NULL;</p> <p> for(i=0;i<6;i++)<br /> {<br /> Renode *S = (Renode*)malloc(sizeof(Renode));<br /> S->key = i;<br /> LinkHinsert(HT,S);<br /> }</p> <p> for(i=0;i<6;i++)<br /> {<br /> Renode *S = (Renode*)malloc(sizeof(Renode));<br /> S->key = i;<br /> LinkHinsert(HT,S); //注意指针数组实参<br /> }</p> <p> return 0;<br /> }