运用链表实现简易通讯录功能

#include <stdio.h>
#include<stdlib.h>
#include<string.h>
//#define NULL 0
#define LEN sizeof(struct Student)
struct Student
{
int num;
char name[10];
char sex[3];
struct Student*next;
};
struct Student Stu[30]={
{1,"陈文宇","M",NULL},
{2,"毛泽权","M",NULL},
{3,"杨继福","M",NULL},
{4,"朱志文","M",NULL},
{5,"陈立军","M",NULL},
{6,"蔡鸿飞","M",NULL},
{7,"王胜","M",NULL},
{8,"王丽娜","M",NULL},
{9,"葛兰","M",NULL},
{10,"袁璇","M",NULL},
{11,"陶钧溢","M",NULL},
{12,"章安刘","M",NULL},
{13,"王卫","M",NULL},
{14,"关慧敏","M",NULL},
{15,"王胤翔","M",NULL},
{16,"赵于意","M",NULL},
{17,"王冕","M",NULL},
{18,"茹冬","M",NULL},
{19,"潘柏儒","F",NULL},
{20,"张梦缘","F",NULL},
{21,"陈春旭","F",NULL},
{22,"李壮伟","F",NULL},
{23,"闻婉婉","F",NULL},
{24,"孙丹","F",NULL}
};
struct Student*creat();
void printlist(struct Student *head);
struct Student*creat1();
struct Student*delNode(struct Student*head);
struct Student*update(struct Student*head);
struct Student*add(struct Student*head);
//************************************
struct Student *creat1()
{

struct Student *head;
head = NULL;
head = &Stu[0];
int i;
for(i=0;i<24;i++)
Stu[i].next = &Stu[i+1];
Stu[i-1].next = NULL;
return head;
}
//********************
struct Student*creat()
{
struct Student*head,*p1,*p2;
int num,n=0;
char name[10];
char sex[3];
head = NULL;
p1 = p2 = (struct Student*)malloc(LEN);
printf("请输入成员序号:");
scanf("%d",&p1->num);
getchar();
printf("请输入成员姓名:");
scanf("%s",p1->name);
getchar();
printf("请输入成员性别:");
scanf("%s",p1->sex);
getchar();
while(p1->num !=0)
{
n ++;
if(n == 1)
head = p1;
else
p2->next = p1;
p2 = p1;
p1 = (struct Student*)malloc(LEN);
printf("请输入成员序号:");
scanf("%d",&p1->num);
getchar();
if(p1->num == 0)
break;
printf("请输入成员姓名:");
scanf("%s",p1->name);
getchar();
printf("请输入成员性别:");
scanf("%s",p1->sex);
getchar();
}
p2->next = NULL;
return head;
}
//**************逐个查看*************************
void look(struct Student*head)
{
struct Student*p;
printf("欢迎查看!\n");
int num;
printf("你要查看位置的序号:\n");
scanf("%d",&num);
for(p = head;p->num != num;p=p->next);
if(head = NULL)
printf("无!\n");
else
printf("num:%d,name:%s,sex:%s\n",p->num,p->name,p->sex);

}
//**********打印链表******************

void printlist(struct Student*head)
{
struct Student*p;
printf("欢迎查看所有人!\n");
p = head;
if(head != NULL)
{
do
{
printf("num:%d,name:%s,sex:%s\n",p->num,p->name,p->sex);
p = p->next;
}while(p != NULL);
/*while(p->next != NULL)
{
printf("num=%d score=%f name=%s\n",p->num,p->score,p->name);
p = p->next;
}*/
}
}

//*********删除结点*****************

struct Student*delNode(struct Student*head)
{
struct Student*p1,*p2;
printf("欢迎使用删除功能!\n");
int num;
printf("请输入你要删除的成员的位置序号:\n");
scanf("%d",&num);
if(head == NULL)
{
printf("The List is NULL.\n");
}
else
{
p1 = head;
while(p1 != NULL && p1->num != num)
{
p2 = p1;
p1 = p1->next;
}
if(p1->num == num)
{
if(p1 == head)
head = p1->next;
else
{
p2->next = p1->next;
}
while(p1->next != NULL)
{
p1 = p1->next;
p1->num -= 1;
}
}
else
printf("Can not find list num.\n");
}
return head;
}
//*********更新结点*************************

struct Student*update(struct Student*head)
{
int index;
int num;
char name[10];
char sex[3];
struct Student *p;
printf("欢迎使用修改功能!\n");
printf("输入你要更新位置序号:\n");
scanf("%d",&index);
getchar();
printf("输入新的姓名,性别:\n");
scanf("%s %s",name,sex);
getchar();
if(head == NULL)
{
printf("The List is NULL.\n");
}
else
{
p=head;
while(p->next != NULL && p->num != index)
{
p = p->next;
}
if(p->num == index)
{
//p->num = num;
strcpy(p->name,name);
strcpy(p->sex,sex);
}
else
printf("Can not find list index.\n");
}
return head;
}
//*********增加结点****************

struct Student*add(struct Student*head)
{
int index;
int num;
char x[5] = {"0"};
char name[10];
char sex[3];
struct Student*p1,*p2,*p3;
printf("欢迎使用添加功能!\n");
printf("输入你要增加位置序号:\n");
scanf("%d",&index);
num = index;
printf("你要增加的姓名和性别:\n");
scanf("%s %s",name,sex);
getchar();
while(strcmp(name,x) != 0)
{
p3 = (struct Student*)malloc(LEN);
p3->num = num;
strcpy(p3->name,name);
strcpy(p3->sex,sex);
if(head == NULL)
{
printf("The List is NULL.\n");
}
else
{
p1 = p2 = head;
while(p1->next != NULL && p1->num != index)
{
p1 = p1->next;
p2 = p1;
}
if(p1->num == index)
{
if(p2->next == NULL)
{
p2->next = p3;
p3->next = NULL;
}
else
{
p3->next = p2->next;
p2->next = p3;
}
while(p1->next != NULL)
{
p1 = p1->next;
p1->num += 1;
}
}
else
{
if(index == 0)
{
p3->next = head;
head = p3;
while(p3->next != NULL)
{
p3->num += 1;
p3 = p3->next;
}
p3->num += 1;
}
else
printf("Can not find list index.\n");
}
}
printf("你要增加的姓名和性别:\n");
scanf("%s %s",name,sex);
getchar();
}
return head;
}
int main()
{
struct Student*head;
head = creat1();
/*printlist(head);
scanf("%d",&num);
scanf("%d",&index);
scanf("%d,%f",&num,&score);
head = delNode(head,num);
printlist(head);
head = add(head,index,num,score);
printlist(head);*/
printf("欢迎来到154班通讯录！\n");
printf("通讯录功能如下:\n");
printf("1.逐个查找 2.查看成员 3.删除成员 4.修改成员信息 5.增加成员 6.创建新的通讯录 7.功能结束\n");
while(1)
{
int t;
scanf("%d",&t);
getchar();
switch(t)
{
case 1:look(head);break;
case 2:printlist(head);break;
case 3:head = delNode(head);break;
case 4:head = update(head);break;
case 5:head = add(head);break;
case 6:head = creat(head);break;
case 7:printf("谢谢使用！\n");break;
default :printf("错误指令！\n");break;
}
if(t<7)
printf("1.逐个查找 2.查看成员 3.删除成员 4.修改成员信息 5.增加成员 6.创建新的通讯录 7.功能结束\n");
else
break;
}
return 0;
}

运用链表实现简易通讯录功能

猜你喜欢