c++，哈希表，创建与查找

哈希表详解，c++

#include
#include<string.h>
using namespace::std;

#define Max_capacity 50
#define SUCCESS 1
#define UNSCESS 0
#define random_six “-1234”

class Hashtable{
public:
Hashtable();
~Hashtable();
int hash(char *t1);
void inithashtable(string *&t);
void inserthashtable(string *&t3,char *t4, int *addr1);
int serchhashtable(string *&t2, char *key1, int *addr2);
private:
string *ct;
char *key;
void *value;
};

Hashtable::Hashtable(){
ct = NULL;
key = NULL;
value = NULL;
}
Hashtable::~Hashtable(){
ct = NULL;
key = NULL;
value = NULL;
}
int Hashtable::hash(char *t1){
char ch1;
ch1 = *t1;
int j = static_cast(ch1);
return j % Max_capacity;
}
void Hashtable::inithashtable(string *&t){
t = new string[Max_capacity];
int j;
for (j = 0; j < 50; j++){
t[j] = random_six;
}
}
void Hashtable::inserthashtable(string *&t3, char *t4,int *addr1){
*addr1 = hash(t4);
while (t3[*addr1] !=random_six){
*addr1 = *addr1 + 1;
}
t3[*addr1] = t4;
}
int Hashtable::serchhashtable(string *&t2, char *key1, int *addr2){
*addr2 = hash(key1);
while (t2[*addr2] != key1){
*addr2 = *addr2 + 1;
if (t2[*addr2] == random_six){
return UNSCESS;
}
else if (*addr2 == hash(key1)){
return UNSCESS;
}
}
return SUCCESS;
}
int main(){
int j;
Hashtable h1;
string *w;
int *temp = new int[50];
h1.inithashtable(w);
char *t[10] = { “beijing”, “baibai”, “shanghai”, “tianjing”, “yunnan”, “hebei”, “shengzheng”, “suzhou”, “guangzhou”, “american” };
for (j = 0; j < 10; j++){
h1.hash(t[j]);
h1.inserthashtable(w, t[j], temp);
}
cout << “------------------------------------------------” << endl;
int u = h1.serchhashtable(w,t[3], temp);
cout << u << endl;
return 0;
}