哈希表（线性探测法处理冲突）

#include<stdio.h>#define M 30struct hashnode{int data;int isnull;};hashnode hashtable[M];void inithash(){int i;for (i = 0; i < M; i++){hashtable[i].isnull = 1;}}int gethashaddress(int key){return key % 29;}int insert(int key){int address = gethashaddress(key);if (hashtable[address].isnull == 1){hashtable[address].data = key;hashtable[address].isnull = 0;}else{while (hashtable[address].isnull == 0 && address < M){address++;}if (address == M){return -1;}hashtable[address].data = key;hashtable[address].isnull = 0;}return 0;}int find(int key)      {int address = gethashaddress(key);while (!(hashtable[address].isnull == 0 && hashtable[address].data == key && address<M)){address++;}if (address == M)address = -1;return address;}