#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]={}; //可以自己直接用数组创建好
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 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;
}
}
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);
printf("输入新东西:\n");
scanf("%d,%s,%s",&num,name,sex);
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->sex,sex);
strcpy(p->name,name);
}
else
printf("Can not find list index.\n");
}
return head;
}
//*********增加结点****************
struct Student*add(struct Student*head)
{
int index;
int num;
char name[10];
char sex[3];
struct Student*p1,*p2,*p3;
printf("欢迎使用添加功能!\n");
printf("输入你要增加位置序号:\n");
scanf("%d",&index);
printf("你要增加的东西:\n");
scanf("%d,%s,%s",&num,name,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)
{
p3 = (struct Student*)malloc(LEN);
p3->num = num;;
strcpy(p3->name,name);
strcpy(p3->sex,sex);
if(p2->next == NULL)
{
p2->next = p3;
p3->next = NULL;
}
else
{
p3->next = p2->next;
p2->next = p3;
}
}
else
printf("Can not find list index.\n");
}
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.功能结束\n");
while(1)
{
int t;
scanf("%d",&t);
getchar();
switch(t)
{
case 1:printlist(head);break;
case 2:head = delNode(head);break;
case 3:head = update(head);break;
case 4:head = add(head);break;
case 5:head = creat(head);break;
case 6:printf("谢谢使用!\n");break;
default :printf("错误指令!\n");break;
}
if(t<6)
printf("1.查看成员 2.删除成员 3.修改成员信息 4.增加成员 5.创建新的通讯录 6.功能结束\n");
else
break;
}
return 0;
}
#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]={}; //可以自己直接用数组创建好
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 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;
}
}
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);
printf("输入新东西:\n");
scanf("%d,%s,%s",&num,name,sex);
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->sex,sex);
strcpy(p->name,name);
}
else
printf("Can not find list index.\n");
}
return head;
}
//*********增加结点****************
struct Student*add(struct Student*head)
{
int index;
int num;
char name[10];
char sex[3];
struct Student*p1,*p2,*p3;
printf("欢迎使用添加功能!\n");
printf("输入你要增加位置序号:\n");
scanf("%d",&index);
printf("你要增加的东西:\n");
scanf("%d,%s,%s",&num,name,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)
{
p3 = (struct Student*)malloc(LEN);
p3->num = num;;
strcpy(p3->name,name);
strcpy(p3->sex,sex);
if(p2->next == NULL)
{
p2->next = p3;
p3->next = NULL;
}
else
{
p3->next = p2->next;
p2->next = p3;
}
}
else
printf("Can not find list index.\n");
}
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.功能结束\n");
while(1)
{
int t;
scanf("%d",&t);
getchar();
switch(t)
{
case 1:printlist(head);break;
case 2:head = delNode(head);break;
case 3:head = update(head);break;
case 4:head = add(head);break;
case 5:head = creat(head);break;
case 6:printf("谢谢使用!\n");break;
default :printf("错误指令!\n");break;
}
if(t<6)
printf("1.查看成员 2.删除成员 3.修改成员信息 4.增加成员 5.创建新的通讯录 6.功能结束\n");
else
break;
}
return 0;
}