Hash表，链表实现

基础的东西，但是貌似某个高管（yahoo!?）说过，hash ! hash ! hash!

 

测试程序：

#include "Hash.h"#include <iostream>#include <time.h>#include <stdlib.h>#define BUCKETNUM 10#define INSERTNUM 500using namespace std;int main(int argc, char **argv){ srand(time(NULL)); HashTable table(BUCKETNUM); for(int i=0;i<INSERTNUM;++i) {table.addEle((int)rand()%30); } table.printHashTable(); return 0;}

 

hash表类：

#ifndef _H_HASH#define _H_HASH#include <stdlib.h>#include <iostream>using namespace std;struct Node;typedef struct Node *PNode;typedef struct Node *Link;struct Node{ int data; PNode link;};class HashTable{ public: HashTable():m_array(NULL),m_size(0){} ~HashTable() {if(m_array!=NULL){ delete [] m_array; m_array=NULL;} } HashTable(int m) {m_array=new Node[m];for(int i=0;i<m;++i){ m_array[i].data=-1; m_array[i].link=NULL;}m_size=m; } int hash(int element) {return element%(m_size-1); } int searchTable(int element) {int key=hash(element);if(m_array[key].data==-1){ return -1;}else{ PNode tmp=&m_array[key]; int index=0; tmp=tmp->link; while(tmp!=NULL) {++index;if(tmp->data==element){ return index;}tmp=tmp->link; } return -1;} } void printHashTable() {for(int i=0;i<this->m_size;++i){ cout<<i<<" "<<m_array[i].data<<" "; if(!m_array[i].data) {PNode tmp=&m_array[i];tmp=tmp->link;while(tmp!=NULL){ cout<<"->"; cout<<tmp->data; tmp=tmp->link;} } cout<<endl;} } void addEle(int element) {int key=hash(element);if(m_array[key].data==-1){ PNode p=(PNode)malloc(sizeof(struct Node)); p->data=element; p->link=NULL; m_array[key].link=p; m_array[key].data=0;}else{ if(searchTable(element)==-1) {PNode tmp=&m_array[key];while(tmp->link!=NULL){ tmp=tmp->link;}PNode p=(PNode)malloc(sizeof(struct Node));p->data=element;p->link=NULL;tmp->link=p; }} } void deleEle(int element) {int key=element;int index=0;if((index=searchTable(element))==-1){ cout<<"sorry, don't find it ..."<<endl; return;}PNode tmp=&m_array[key];tmp=tmp->link;PNode pre=tmp;while(tmp!=NULL){ if(tmp->data==element) {pre->link=tmp->link;free(tmp);tmp=NULL;cout<<"Find it, delete..."<<endl;return; } tmp=tmp->link; pre=pre->link;} }private: Node *m_array; int m_size;};#endif

输出结果：

0 0 ->0->27->18->9
1 0 ->1->28->19->10
2 0 ->29->20->2->11
3 0 ->12->3->21
4 0 ->22->4->13
5 0 ->5->14->23
6 0 ->15->24->6
7 0 ->7->16->25
8 0 ->26->17->8
9 -1