利用哈希表写个电话簿（拉链法解决hash冲突）

#include "bits/stdc++.h"
#include "conio.h"
#include "windows.h"
using namespace std;
typedef struct node{
    char name[100];//姓名
    char phoneNumber[13];//电话号码
    struct node * next;//查找下一个的指针
}Node;
char fname[100] = {'\0'};//输入的联系人名字不得超过100个字符
Node People[27];//电话本
int hash_lock(char c)
{
    if(c >= 'A' && c <= 'Z')
        return c - 'A';
    else if(c >= 'a' && c <= 'z')
        return c - 'a';
    else return -1;
}
void Insert()//增加联系人
{
    int key;
    while(1){
    Node *aa = (Node *)malloc(sizeof(Node));
    cin >> aa->name;
    if(aa->name[0] == '-'){
        free(aa);//释放空间
        cout << "Insert over!" << endl;
        return;
    }
    cin >> aa->phoneNumber;
    if(strlen(aa->phoneNumber) != 11){
        cout << "PhoneNumber format is wrong!" << endl;
        continue;
    }
    else {
            key = hash_lock(aa->name[0]);
            if(key == -1){
                cout << "Name format is wrong!" << endl;
                cout << "Please input again:" << endl;
                continue;
            }
    }
    aa->next = People[key].next;//直接头插法
    People[key].next = aa;
    cout << "Inserting successful!" << endl;
}
}
void Find(char *findName)//查找联系人
{
    int key;
    if(findName[0] == '\0' || findName[0] == ' '){
        cout << "Find fail!" << endl;
        return;
    }
    key = hash_lock(findName[0]);
    if(key == -1){
        cout << "Your find format is wrong!" << endl;
        return;
    }
    Node *p = People[key].next;
    while(p){
        if(strcmp(p->name,findName) == 0 && strlen(p->name) == strlen(findName)){
            cout << "Name:" << p->name << endl;
            cout << "PhoneNumber:" << p->phoneNumber <<endl;
            return;
        }
        p = p->next;
    }
    if(p == NULL){
        cout << "Haven't this people" << endl;
        return;
    }
}
void Delete(char *deleteName)//删除联系人
{
    int key;//检索关键字
    if(deleteName[0] == '\0' || deleteName[0] == ' '){
        cout << "Find fail!" << endl;
        return;
    }
    key = hash_lock(deleteName[0]);
    if(key == -1){//key对应的键值映射到hash表
        cout << "Your delete format is wrong!" << endl;
        return;
    }
    Node *p1,*p2;
    p1 = People[key].next;
    if(p1 == NULL){
        cout << "The contact does not exist!" << endl;//如果没找到的话;
        return;
    }
    if(strcmp(p1->name,deleteName) == 0 && strlen(p1->name) == strlen(deleteName)){//防止首字母重名相等
        People[key].next = p1->next;
        cout << "Deleting successful!" << endl;
        free(p1);//释放空间
        return;
    }
    p2 = p1->next;
    while(p2 != NULL){
        if(strcmp(p2->name,deleteName) == 0 && strlen(p2->name) == strlen(deleteName)){//防止首字母重名相等
            p1 = p2->next;
            free(p2);
            cout << "Deleting successful!" << endl;
            return;
        }
        p1 = p2;
        p2 = p2->next;
    }
    cout << "The contact does not exist!" << endl;//如果没找到的话
    return;
}
void sFind()
{
    cout << "Input your find name:(input '-' to end)" << endl;
    while(1){
        int i = 0;
        char c;
        while((c = getchar()) != '\n')//解决第一个为空格的问题
            fname[i++] = c;
        if(i == 0)
            cout << "Input wrong,try again" << endl;
        else if(fname[i - 1] == '-'){
            cout << "Finding over!" << endl;
            break;
        }
        else
            Find(fname);
        memset(fname,0,sizeof(fname));//清空字符串
    }
    fflush(stdin);//清空'-'后的回车

}
void sInsert()
{
    cout << "Insert contacts:(input '-' to end)" << endl;
    Insert();//插入联系人
    fflush(stdin);//清除'-'后的回车
}
void sDelete()
{
    cout << "Deleting contacts:(input '-' to end)" << endl;
    while(1){
        int i = 0;
        char c;
        while((c = getchar()) != '\n')//解决第一个为空格的问题
            fname[i++] = c;
        if(i == 0)
            cout << "Input wrong,try again" << endl;
        else if(fname[i - 1] == '-'){
            cout << "Deleting over" << endl;
            break;
        }
        else
            Delete(fname);
        memset(fname,0,sizeof(fname));//清空字符串
    }
    fflush(stdin);//清空'-'后的回车
}
int main()
{
    int choose;
    for(int i = 0;i < 27;i++)
        People[i].next = NULL;//初始化电话簿
    cout << "****************************Welcome to My phonenumbers!****************************************"<<endl;
    cout << "****************************You're Phone have three functions**********************************"<<endl;
    cout << "First:Add contacts(input 1)" << endl;//第一个功能：插入功能
    cout << "Second:Delete contacts(input 2)" << endl;//第二个功能：删除功能
    cout << "Third:Find contacts(input 3)" << endl;//第三个功能：查找功能
    cout << "Declare:If you want to quit,Please input （ESC） key.Thanks for your use!" << endl;
    while((choose = getch()) != 27){
        if((choose - 48) < 1 && (choose - 48) > 3){
            cout << "Not have this function,Please input again!" << endl;
            continue;
        }
        switch(choose - 48){
            case 1 : sInsert();Sleep(2000);system("cls");break;
            case 2 : sDelete();Sleep(2000);system("cls");break;
            case 3 : sFind();Sleep(2000);system("cls");break;
        }
        cout << "First:Add contacts(input 1)" << endl;//第一个功能：插入功能
        cout << "Second:Delete contacts(input 2)" << endl;//第二个功能：删除功能
        cout << "Third:Find contacts(input 3)" << endl;//第三个功能：查找功能
        cout << "Declare:If you want to quit,Please input (ESC) key.Thanks for your use!" << endl;
    }
    return 0;
}