电话查询系统
1. 项目要求2. 数据样例3. 运行界面4. 代码分析5. 完整代码6. 项目报告
关注博主不迷路,博主带你码代码!
1. 项目要求
设每个记录有以下数据项:用户名、电话、地址从键盘输入各个记录,以电话号码为关键字建立哈希表能够增加、修改、删除给定电话号码的相关记录
2. 数据样例
7
17718881666 chen hunan
12837192867 yuan hubei
18998239899 duan loudi
13689721388 qian hefei
19999999999 zhang beijing
12673678523 liu liuan
13876352729 luo fujian
3. 运行界面
菜单页面 ![在这里插入图片描述](https://img-blog.csdnimg.cn/5bec45ba12f94b42a1c0efd19cee98ad.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5Zyo5Lq66Ze06LSf5YC6Xg==,size_20,color_FFFFFF,t_70,g_se,x_16) 添加电话 ![在这里插入图片描述](https://img-blog.csdnimg.cn/9291e1b036ae4471aa559776ad4a6301.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5Zyo5Lq66Ze06LSf5YC6Xg==,size_20,color_FFFFFF,t_70,g_se,x_16) 查询电话 ![在这里插入图片描述](https://img-blog.csdnimg.cn/1392f95b43ac4a8faa340092ecd924d0.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5Zyo5Lq66Ze06LSf5YC6Xg==,size_20,color_FFFFFF,t_70,g_se,x_16) 修改信息 ![在这里插入图片描述](https://img-blog.csdnimg.cn/7ce53edbf27744629872103ddc59ea5d.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5Zyo5Lq66Ze06LSf5YC6Xg==,size_20,color_FFFFFF,t_70,g_se,x_16) 删除电话 ![在这里插入图片描述](https://img-blog.csdnimg.cn/c11f54d74eee4c1ebcbaa7b80cd0931e.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5Zyo5Lq66Ze06LSf5YC6Xg==,size_20,color_FFFFFF,t_70,g_se,x_16) 退出系统 ![在这里插入图片描述](https://img-blog.csdnimg.cn/a2551cce76bc4ac28a0167983020e3b8.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5Zyo5Lq66Ze06LSf5YC6Xg==,size_20,color_FFFFFF,t_70,g_se,x_16)
4. 代码分析
哈希函数 key 值的确定是按照电话号码的求和 % MAXSIZE所得的 % MAXSIZE 的原因是因为放置下标越界
int GetHashKey(char ar[])
{
int len = strlen(ar);
int key = 0;
int i;
for(i = 0; i
Czy = 1; //从2,3,4,5,.......
while(1)
{
Czy ++ ; //从2,3,4,5,.......
if(Czy % 2 == 0)
{
if(table->data[(key + (Czy / 2) * (Czy / 2)) % MAXSIZE].Name[0] == 0)
return (key + (Czy / 2) * (Czy / 2)) % MAXSIZE;
}
else if(Czy % 2 != 0) {
if((key - (Czy / 2) * (Czy / 2)) data[(key - (Czy / 2) * (Czy / 2)) % MAXSIZE].Name[0] == 0)
return (key - (Czy / 2) * (Czy / 2)) % MAXSIZE;
}
}
//return -1;
}
构建哈希表 构建哈希表的时候,我们先要得到哈希函数的 key 值,然后判断是否产生哈希冲突 由于我们的电话、姓名、地址都是使用的字符串结构,所以在讲结构体中的数据存入到哈希表的时候,直接使用 strcpy 赋值函数就可以了
//构建哈希表
void CreateHashTable(HashTable table, Record *record, int n)
{
int key;
int i;
for(i = 0; i
int flag = 0;
int key = GetHashKey(PhoneNumber);
if(strcmp(table->data[key].Number, PhoneNumber)) // 如果没有匹配成功,则对其尽心冲突查找
{
for(Czy = 1; Czy
if(!strcmp(PhoneNumber, table->data[(key + (Czy / 2) * (Czy / 2)) % MAXSIZE].Number))
{
key = (key + (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
else if(Czy % 2 != 0)
{
if((key - (Czy / 2) * (Czy / 2)) data[(key - (Czy / 2) * (Czy / 2)) % MAXSIZE].Number))
{
key = (key - (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
}
flag = 1;
}
if(flag) printf("未找到!请重新输入!\n");
else
{
if(!table->data[key].flag) printf("搜索到的号码信息为:\n%s %s %s\n",table->data[key].Name,table->data[key].Number,table->data[key].Address);
else printf("未找到!请重新输入!\n");
}
return flag;
}
添加电话 添加电话就很简单了,在读入数据后,就直接添加到哈希表中就可以了
void add()
{
int k = 0;
int i;
printf("请输入要添加的数量:\n");
scanf("%d", &k);
printf("请输入添加的信息(电话、姓名、地址):\n");
for(i = 0; i
char PhoneNumber[20];
char Name[20];
char Address[20];
int key;
int flag = 0;
printf("请输入要修改的电话:\n");
scanf("%s", PhoneNumber);
key = GetHashKey(PhoneNumber);
if(strcmp(table->data[key].Number, PhoneNumber)){
for(Czy = 1; Czy
if(!strcmp(PhoneNumber, table->data[(key + (Czy / 2) * (Czy / 2)) % MAXSIZE].Number)){
key = (key + (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
else if(Czy % 2 != 0) {
if((key - (Czy / 2) * (Czy / 2)) data[(key - (Czy / 2) * (Czy / 2)) % MAXSIZE].Number)){
key = (key - (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
}
flag = 1;
}
if(flag) printf("未找到!请重新输入!\n");
else
{
if(!table->data[key].flag)
{
printf("搜索到的号码信息为:\n%s %s %s\n", table->data[key].Name, table->data[key].Number, table->data[key].Address);
printf("请输入你要修改的名字:\n");
scanf("%s", &Name);
printf("请输入你要修改的地址:\n");
scanf("%s", &Address);
strcpy(table->data[key].Name, Name);
strcpy(table->data[key].Address, Address);
printf("修改成功!\n");
}
else printf("未找到!请重新输入!\n");
}
}
删除电话 删除操作我们只需要对于每个数据添加一个是否删除的标记,当被删除后,就将标记置为 1 ,当我们需要进行修改或者查询的时候,只需要对标记进行判断一下就行了
void del(HashTable table)
{
char PhoneNumber[20];
int key;
int flag = 0;
printf("请输入要删除的电话:\n");
scanf("%s",PhoneNumber);
key = GetHashKey(PhoneNumber);
flag = SerchKey(numbertable,PhoneNumber);
if(!flag)
{
table->data[key].flag = 1;
printf("删除成功!\n");
}
}
主页面 主页面主要包括菜单选项,使用 switch 结构实现
int main(){
int p = 0;
int k = 0;
numbertable = &table;
numbertable->data = (Record*)malloc(sizeof(record[0])*MAXSIZE);
memset(numbertable->data, 0, sizeof(record[0])*MAXSIZE);
numbertable->size = MAXSIZE;
numbertable->cnt = 0;
while(p != -1)
{
puts("");
puts("");
puts("");
printf("\t\t电话号码查询系统\n");
printf("\t\t1.添加电话\n");
printf("\t\t2.查询电话\n");
printf("\t\t3.修改信息\n");
printf("\t\t4.删除电话\n");
printf("\t\t5.退出系统\n");
puts("");
printf("\t\t请输入(1、2、3、4):\n");
scanf("%d",&p);
switch(p){
case 1: add(); break;
case 2: find(); break;
case 3: revise(numbertable); break;
case 4: del(numbertable); break;
case 5: p = -1; break;
}
}
return 0;
}
5. 完整代码
#include
#include
#include
#define MAXSIZE 50
int Czy = 1;
typedef struct record
{
char Number[20]; // 电话
char Name[20]; // 姓名
char Address[20]; // 地址
int flag; // 是否删除
}Record;
typedef struct Hash
{
Record *data;
int cnt;
int size;
}*HashTable,HashElem;
//定义及初始化
HashElem table;
HashTable numbertable;
Record record[50];
//哈希函数,将电话号码每一位求和
int GetHashKey(char ar[])
{
int len = strlen(ar);
int key = 0;
int i;
for(i = 0; i
Czy = 1; //从2,3,4,5,.......
while(1)
{
Czy ++ ; //从2,3,4,5,.......
if(Czy % 2 == 0)
{
if(table->data[(key + (Czy / 2) * (Czy / 2)) % MAXSIZE].Name[0] == 0)
return (key + (Czy / 2) * (Czy / 2)) % MAXSIZE;
}
else if(Czy % 2 != 0) {
if((key - (Czy / 2) * (Czy / 2)) data[(key - (Czy / 2) * (Czy / 2)) % MAXSIZE].Name[0] == 0)
return (key - (Czy / 2) * (Czy / 2)) % MAXSIZE;
}
}
//return -1;
}
//构建哈希表
void CreateHashTable(HashTable table, Record *record, int n)
{
int key;
int i;
for(i = 0; i
int flag = 0;
int key = GetHashKey(PhoneNumber);
if(strcmp(table->data[key].Number, PhoneNumber)) // 如果没有匹配成功,则对其尽心冲突查找
{
for(Czy = 1; Czy
if(!strcmp(PhoneNumber, table->data[(key + (Czy / 2) * (Czy / 2)) % MAXSIZE].Number))
{
key = (key + (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
else if(Czy % 2 != 0)
{
if((key - (Czy / 2) * (Czy / 2)) data[(key - (Czy / 2) * (Czy / 2)) % MAXSIZE].Number))
{
key = (key - (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
}
flag = 1;
}
if(flag) printf("未找到!请重新输入!\n");
else
{
if(!table->data[key].flag) printf("搜索到的号码信息为:\n%s %s %s\n",table->data[key].Name,table->data[key].Number,table->data[key].Address);
else printf("未找到!请重新输入!\n");
}
return flag;
}
void add()
{
int k = 0;
int i;
printf("请输入要添加的数量:\n");
scanf("%d", &k);
printf("请输入添加的信息(电话、姓名、地址):\n");
for(i = 0; i
char PhoneNumber[20];
char Name[20];
char Address[20];
int key;
int flag = 0;
printf("请输入要修改的电话:\n");
scanf("%s", PhoneNumber);
key = GetHashKey(PhoneNumber);
if(strcmp(table->data[key].Number, PhoneNumber)){
for(Czy = 1; Czy
if(!strcmp(PhoneNumber, table->data[(key + (Czy / 2) * (Czy / 2)) % MAXSIZE].Number)){
key = (key + (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
else if(Czy % 2 != 0) {
if((key - (Czy / 2) * (Czy / 2)) data[(key - (Czy / 2) * (Czy / 2)) % MAXSIZE].Number)){
key = (key - (Czy / 2) * (Czy / 2)) % MAXSIZE;
break;
}
}
}
flag = 1;
}
if(flag) printf("未找到!请重新输入!\n");
else
{
if(!table->data[key].flag)
{
printf("搜索到的号码信息为:\n%s %s %s\n", table->data[key].Name, table->data[key].Number, table->data[key].Address);
printf("请输入你要修改的名字:\n");
scanf("%s", &Name);
printf("请输入你要修改的地址:\n");
scanf("%s", &Address);
strcpy(table->data[key].Name, Name);
strcpy(table->data[key].Address, Address);
printf("修改成功!\n");
}
else printf("未找到!请重新输入!\n");
}
}
void del(HashTable table)
{
char PhoneNumber[20];
int key;
int flag = 0;
printf("请输入要删除的电话:\n");
scanf("%s",PhoneNumber);
key = GetHashKey(PhoneNumber);
flag = SerchKey(numbertable,PhoneNumber);
if(!flag)
{
table->data[key].flag = 1;
printf("删除成功!\n");
}
}
int main(){
int p = 0;
int k = 0;
numbertable = &table;
numbertable->data = (Record*)malloc(sizeof(record[0])*MAXSIZE);
memset(numbertable->data, 0, sizeof(record[0])*MAXSIZE);
numbertable->size = MAXSIZE;
numbertable->cnt = 0;
while(p != -1)
{
puts("");
puts("");
puts("");
printf("\t\t电话号码查询系统\n");
printf("\t\t1.添加电话\n");
printf("\t\t2.查询电话\n");
printf("\t\t3.修改信息\n");
printf("\t\t4.删除电话\n");
printf("\t\t5.退出系统\n");
puts("");
printf("\t\t请输入(1、2、3、4):\n");
scanf("%d",&p);
switch(p){
case 1: add(); break;
case 2: find(); break;
case 3: revise(numbertable); break;
case 4: del(numbertable); break;
case 5: p = -1; break;
}
}
return 0;
}
6. 项目报告
项目优点: 使用的哈希表存储信息,并采用了二次探测的方法解决哈希冲突的问题 并采用手机号作为唯一标识 运行二次添加的时候,不进行覆盖操作,紧接着在表后面进行添加 项目缺点: 手机号的正确与错误输入没有限制 姓名的正确与错误输入没有限制 地址的正确与错误输入没有限制
关注博主不迷路,博主带你码代码!
|