数据结构上机实验报告通讯录陈冠豪20102105010101015二O一O年5月26号实验目的通讯录内容有：姓名、通讯地址、电话号码。
要求：（1）建立通信录（2）插入一个人员信息。
（3）删除指定的人员信息。
（4）按姓名项的字母顺序递增排列；（5）能查找通讯录中某人的信息；实现代码://////////By Lea////////////// ////////2010210501//////////// //用链式存储结构的通讯录//By Lea.(2010210501)#include <stdio.h>#include <string.h>#include <stdlib.h>//#include "system.h"#define maxsize 100/*通讯信息的结构类型定义*/typedef struct{char num[10];char name[10];char phone[12];char addres[12];}DataType;struct persons{ char num[10];char name[10];char phone[12];char addres[12];}psn[maxsize];typedef struct node{DataType data;struct node *next;}ListNode,*LinkList;void InsertList(LinkList head){LinkList p;p=(LinkList)malloc(sizeof(ListNode));p->next=NULL;printf("\nInput the new node\n");printf("number:\n");gets(p->data.num);printf("name:\n");gets(p->);printf("phone:\n");gets(p->data.phone);printf("addres:\n");gets(p->data.addres);p->next=head->next;head->next=p;}/*查询函数：可以按编号或姓名在链表中查找出对应的记录。
*/ LinkList SearchList(LinkList head){LinkList p;char ch[10];printf("input the name:\n");gets(ch);p=head;p=p->next;while(p!=NULL&&strcmp(ch,p->data.num)!=0&&strcmp(ch,p->)!=0) p=p->next;return p;}/*删除记录：可以按照编号或姓名在链表中顺序查找出对应的记录，然后将其删除。
调用查询函数。
*/void DelNode(LinkList head){char x[10];LinkList p,q;printf("input the name you want to delete\n");gets(x);if(head==NULL){printf("this is a empty list.");return ;}p=head;while(strcmp(x,p->data.num)!=0&&strcmp(x,p->)!=0&&p->next!=NULL){q=p;p=p->next;}if(strcmp(x,p->data.num)==0||strcmp(x,p->)==0){if(p==head)head=p->next;elseq->next=p->next;free(p);}elseprintf("Not found.");return ;}/*建立一个通讯录链表，采用手工输入的方法逐个输入每个同学的信息。
*/ LinkList CreatList(){char ctn;LinkList L,s,r;//int i;/* int j;LinkList t;FILE *fp; */L=(LinkList)malloc(sizeof(ListNode));L->next=NULL;r=L;while(ctn!='s'){s=(LinkList)malloc(sizeof(ListNode));printf("number:\n");gets(s->data.num);printf("name:\n");gets(s->);printf("phone:\n");gets(s->data.phone);printf("addres:\n");gets(s->data.addres);printf("input s to exit,any other button continue!\n");ctn=getchar();r->next=s;r=s;}if(r!=NULL)r->next=NULL;/* fp=fopen("people.txt","w");for(t=L,j=0;t!=NULL;j++,t=t->next){strcpy(psn[j].num,t->data.num);strcpy(psn[j].name,t->);strcpy(psn[j].phone,t->data.phone);strcpy(psn[j].addres,t->data.addres);fwrite(&psn[j],sizeof(struct persons),1,fp);} *//* SaveList(L); */return L;}void orderList(LinkList head) /*排序*/{LinkList p,q;q=p=head;for(;q->next;q=q->next)while(p->next){char temp[10];int result=strcmp(p->,p->next->);if(result){temp[10]=*p->;*p->next->=*p->;*p->=*p->next->;}p=p->next;}printf("ordered the list\n");}LinkList readrecord()/* 将文件的信息读入结构体数组在转存入链表中 */ { int j,i;long k;FILE *fp;LinkList L,r,s;L=(LinkList)malloc(sizeof(ListNode));L->next=NULL;r=L;fp=fopen("people.txt","r+t");if(fp!=NULL){printf("\tOpen Success!\n");for(i=1;i<maxsize;i++){j=fgetc(fp);if(j==EOF)return L;k=i-1;fseek(fp,k*sizeof(struct persons),0); /* 读取一个人的信息 */fread(&psn[i],sizeof(struct persons),1,fp);s=(LinkList)malloc(sizeof(ListNode)); /* 装存入链表中 */ strcpy(s->data.num,psn[i].num);strcpy(s->,psn[i].name);strcpy(s->data.phone,psn[i].phone);strcpy(s->data.addres,psn[i].addres);/* if(head==NULL) */ /* 用尾插法将其插入链表中 *//* head=s;elser->next=s;r=s; */r->next=s;r=s;}if(r!=NULL)r->next=NULL;return L;}else{fp=fopen("people.txt","w"); /* 不能打开另开辟一个文件 */i=1;}}/*查看全部记录：从第一个结点到最后一个结点依次输出所有记录。
*/void PrintList(LinkList head){ LinkList p;p=head->next;/*使p指向第一个节点 */printf("number name telephone mobilephone\n");while(p!=NULL){printf("%s %s %s %s\n",p->data.num,p->,p->data.phone,p->data.addres);p=p->next;}}/*显示菜单函数*/void Menu(){printf("**************************PHONEBOOKS************************\n");printf("1--Creat 2--List all 3--Search 4--Insert 5--Delete 6--reorder 0--Exit\n");printf("Please select(Input 0--5)\n");}main(){int t;LinkList p,head;system("cls");head=readrecord();while(1){ Menu();scanf("%d",&t);getchar();/*屏蔽回车*/switch(t){case 1: printf("Creat the PhoneBooks.\n");head=CreatList();//SaveList(head);break;case 2: printf("List all record.\n");PrintList(head);break;case 3: printf("Search.\n");p=SearchList(head);if(p){printf("No. Name Telephone Mobilephone\n");printf("%s %s %s %s\n",p->data.num,p->,p->data.phone,p->data.addres);}else printf("No body.\n");break;case 4: printf("Insert new record.\n");InsertList(head);break;case 5: printf("Delete record.\n");DelNode(head);break;case 6: printf("reording the record.\n");orderList(head);break;case 0: printf("Exit.\n");return;} }}//////////By Lea//////////////////////2010210501//////////////用顺序存储结构的通讯录//By Lea.(2010210501)#include<stdio.h>#include<stdlib.h>#include<string.h>#define FORMAT "%s\t\t%s\t\t%s\t%d\t%s\n" int count=0;struct Address{char Name[21];int Age;char Sex[6];char ClassNum[11];char PhonNum[12];};int Enterface();int Add(Address book[]);int Modify(Address book[]);int Delent(Address book[]);int Insert(Address book[]);int Find(Address book[]);int Show(Address book[]);int FindName(Address book[]);int FindClassNum(Address book[]);int DelName(Address book[]);int DelClassNum(Address book[]);int FindPhonNum(Address book[]);int Readtxt(Address book[]);int Writetxt(Address book[]);int Search(Address book[],char str1[],int n);int FSearch(Address book[],char str2[],int n);int Taxis(Address book[]);int Exit();////////////////////////////////////////////////////////////////// //void main(){Address book[100];int choice;char or='m';system("pause");system("cls");while(or=='m'){choice=Enterface();switch(choice){case 1: Add(book);break;case 2: Modify(book);break;case 3: Delent(book);break;case 4: Insert(book);break;case 5: Find(book);break;case 6: Show(book);break;case 7: Exit();break;default : printf("!!!输入错误!!!\n");Exit();break;}}}int Enterface(){int choice=0;printf("*******************\n");printf(" 1.添加\n");printf(" 2.修改\n");printf(" 3.删除\n");printf(" 4.插入\n");printf(" 5.查找\n");printf(" 6.显示\n");printf(" 7.退出\n");printf("*******************\n");printf("请输入您的选择:");scanf("%d",&choice);return choice;}int Add(Address book[]){char or='Y';while('Y'==or){printf("请输入姓名：");scanf("%s",&book[count].Name);flag1:printf("请输入电话号码：");scanf("%s",&book[count].PhonNum);for(int i=0;i<count;i++){if(strcmp(book[count].PhonNum,book[i].PhonNum)==0){printf("!!!号码已存在!!!\n");goto flag1;}}flag2:printf("请输入学号：");scanf("%s",&book[count].ClassNum);for(i=0;i<count;i++){if(strcmp(book[count].ClassNum,book[i].ClassNum)==0){printf("!!!学号已存在!!!\n");goto flag2;}}printf("请输入年龄：");scanf("%d",&book[count].Age);printf("请输入性别：");scanf("%s",&book[count].Sex);getchar();count++;printf("是否继续添加('Y'添加，其他键返回主界面):");scanf("%c",&or);if('Y'!=or){system("cls");break;}}Taxis(book);Writetxt(book);// printf("sdfsdfsdf\n");return 0;}int Modify(Address book[]){char str[11];int flag=0;int ksd=0;printf("去年个输入学号：");scanf("%s",&str);for(int i=0;i<count;i++){if(strcmp(str,book[i].ClassNum)==0){if(ksd==0){printf(" 姓名\t 电话\t\t学号\t性别\t年龄\n");ksd=1;}printf("%8s\t%8s\t%s\t%s\t%d\n",book[i].Name,book[i].PhonNum, book[i].ClassNum,book[i].Sex,book[i].Age);// str[flag_num++]=i;flag=1;// i--;break;}}if(flag==0){printf("!!!无此记录!!!\n");return 0;}printf("请输入姓名：");scanf("%s",&book[i].Name);flag0:printf("请输入电话号码：");scanf("%s",&book[i].PhonNum);for(int j=0;j<count;j++){if(j==i)continue;if(strcmp(book[i].PhonNum,book[j].PhonNum)==0){printf("!!!号码已存在!!!\n");goto flag0;}}flag3:printf("请输入学号：");scanf("%s",&book[i].ClassNum);for(j=0;j<count;j++){if(j==i)continue;if(strcmp(book[i].ClassNum,book[j].ClassNum)==0){printf("!!!学号已存在!!!\n");goto flag3;}}printf("请输入年龄：");scanf("%d",&book[i].Age);printf("请输入性别：");scanf("%s",&book[i].Sex);getchar();printf("修改完毕!\n");Writetxt(book);system("pause");// printf("modify\n");return 0;}int Delent(Address book[]){// printf("delent\n");int choice=0;printf("================\n");printf(" 1.按姓名删除\n");printf(" 2.按学号删除\n");printf("================\n");scanf("%d",&choice);switch(choice){case 1: DelName(book);break;case 2: DelClassNum(book);break;default :break;}return 0;}int Insert(Address book[]){Add(book);// printf("insert\n");return 0;}int Find(Address book[]){int choice=0;printf("================\n");printf(" 1.按姓名查找\n");printf(" 2.按学号查找\n");printf(" 3.按电话查找\n");printf("================\n");scanf("%d",&choice);switch(choice){case 1: FindName(book);break;case 2: FindClassNum(book);break;case 3: FindPhonNum(book);break;default :break;}// printf("find\n");return 0;}int FindName(Address book[]){char aname[30];printf("请输入要查找的名字：");scanf("%s",&aname);FSearch(book,aname,3);return 0;}int FindClassNum(Address book[]) {char anum[20];printf("请输入要查找的学号：");scanf("%s",&anum);FSearch(book,anum,2);return 0;}int FindPhonNum(Address book[]){char aphonnum[20];printf("请输入要查找的学号：");scanf("%s",&aphonnum);FSearch(book,aphonnum,1);return 0;}int Show(Address book[]){int or=0;if(count==0){printf("!!!无记录!!!\n");system("pause");system("cls");}else{printf(" 姓名\t 电话\t\t学号\t性别\t年龄\n");for(int i=0;i<count;i++)printf("%8s\t%8s\t%s\t%s\t%d\n",book[i].Name,book[i].PhonNum, book[i].ClassNum,book[i].Sex,book[i].Age);system("pause");}printf("是否排序？\n-=1.排序=- -=2.返回主界面=-\n");scanf("%d",&or);if(1==or)Taxis(book);return 0;}int DelName(Address book[]){char aname[20];printf("请输入要删除的姓名：");scanf("%s",&aname);Search(book,aname,2);return 0;}int DelClassNum(Address book[]){char anum[20];printf("请输入要删除的学号：");scanf("%s",&anum);Search(book,anum,1);return 0;}int Readtxt(Address book[]){FILE *fp1;fp1=fopen("photonumbers.txt","r");if(fp1 == NULL){printf("wrong!\n");system("pause");}while(!feof(fp1)){if(!fscanf(fp1,"%s\t\t%s\t\t%s\t%d\t%s",book[count].Name,book[c ount].PhonNum,book[count].ClassNum,&book[count].Age,book[count].Sex))printf("读入出错！");count++;}count--;fclose(fp1);return 0;}int Writetxt(Address book[]){FILE *fp;fp=fopen("photonumbers.txt","w");for(int i=0;i<count;i++){fprintf(fp,FORMAT,book[i].Name,book[i].PhonNum, book[i].ClassNum,book[i].Age,book[i].Sex);}fclose(fp);return 0;}int Search(Address book[],char str1[],int n){int flag=0;int str[5];int flag_num=0;int j;int gf;int ksd=0;for(int i=0;i<count;i++){if(n==1){if(strcmp(str1,book[i].ClassNum)==0)flag=2;}else if(n==2){if(strcmp(str1,book[i].Name)==0)flag=2;}if(flag==2){if(ksd==0){printf(" 姓名\t 电话\t\t学号\t性别\t年龄\n");ksd=1;}printf("%8s\t%8s\t%s\t%s\t%d\n",book[i].Name,book[i].PhonNum, book[i].ClassNum,book[i].Sex,book[i].Age);str[flag_num++]=i;flag=1;}}if(flag==0){printf("!!!无记录!!!\n");system("pause");system("cls");}if(flag==1){printf("-=1.确认删除=-\t-=2.取消=-\n");scanf("%d",&j);if(1==j){gf=1;for(int m=str[0];m<count-flag_num;m++){for(int j=gf-1;j<flag_num;j++){if((m+gf)==str[j])gf++;}strcpy(book[m].Name,book[m+gf].Name);book[m].Age=book[m+gf].Age;strcpy(book[m].ClassNum,book[m+gf].ClassNum);strcpy(book[m].PhonNum,book[m+gf].PhonNum);strcpy(book[m].Sex,book[m+gf].Sex);}count=count-flag_num;Writetxt(book);}else if(2==j){printf("!!!操作已取消!!!\n");}system("pause");}return 0;}int FSearch(Address book[],char str2[],int n){int flag=0;int ksd=0;for(int i=0;i<count;i++){if(n==1){if(strcmp(str2,book[i].PhonNum)==0)flag=2;}else if(3==n){if(strcmp(str2,book[i].Name)==0)flag=2;}else if(2==n){if(strcmp(str2,book[i].ClassNum)==0)flag=2;}if(flag==2){if(0==ksd){printf(" 姓名\t 电话\t\t学号\t性别\t年龄\n");ksd=1;}printf("%8s\t%8s\t%s\t%s\t%d\n",book[i].Name,book[i].PhonNum, book[i].ClassNum,book[i].Sex,book[i].Age);flag=1;}}if(1==flag)system("pause");else if(flag==0){printf("!!!无此记录!!!\n");system("pause");system("cls");}return 0;}int Taxis(Address book[]){/* for(int i=0;i<count;i++){for(int j=0;j<count-1-i;j++){if(strcmp(book[j].ClassNum,book[j+1].ClassNum)>0) {Address bk;strcpy(,book[j].Name);bk.Age=book[j].Age;strcpy(bk.ClassNum,book[j].ClassNum);strcpy(bk.PhonNum,book[j].PhonNum);strcpy(bk.Sex,book[j].Sex);strcpy(book[j].Name,book[j+1].Name);book[j].Age=book[j+1].Age;strcpy(book[j].ClassNum,book[j+1].ClassNum); strcpy(book[j].PhonNum,book[j+1].PhonNum);strcpy(book[j].Sex,book[j+1].Sex);strcpy(book[j+1].Name,);book[j+1].Age=bk.Age;strcpy(book[j+1].ClassNum,bk.ClassNum); strcpy(book[j+1].PhonNum,bk.PhonNum); strcpy(book[j+1].Sex,bk.Sex);}}}printf("!!!操作成功!!!\n");system("pause");system("cls");Writetxt(book);*/return 0;}int Exit(){exit(1);return 0;}。
![[数据结构课程设计通讯录查询系统实验报告范文及源代码]数据结构通讯录](https://img.taocdn.com/s1/m/e16be22d657d27284b73f242336c1eb91a3733b4.png)
