花了3天时间终于做完了,欢迎大家来批评指导
#include <stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 20 //学号和姓名的最大长度
#define OVER -1 //输入结束标志
typedef struct STU //一定要注意两数组长度对其对齐
{
char id[MAX]; //学号
char name[MAX]; //姓名
float score; //成绩
struct STU *next; //指向下一个节点的指针
}Stuif;
#define LEN sizeof(struct STU) //结构长度
void menu(void);
Stuif *create(void);
void print(Stuif *);
void search_object(Stuif *);
Stuif * del_object(Stuif *);
Stuif * insert_object(Stuif *);
void modify(Stuif *);
Stuif *sort(Stuif *);
Stuif * swap_object(Stuif *);
int count(Stuif *);
Stuif * destory(Stuif *);
void save(Stuif *);
Stuif *read(void);
void qiut(void);
int main()
{
int choice;
int total;
Stuif *head = NULL;
menu();
while(1)
{
scanf("%d",&choice);
switch(choice)
{
case 1: menu();break;
case 2: head = create();break;
case 3: print(head);break;
case 4: search_object(head);break;
case 5: head = del_object(head);break;
case 6: head = insert_object(head);break;
case 7: modify(head);
case 8: head = sort(head);break;
case 9: head = swap_object(head);break;
case 10:
total = count(head);
printf("信息个数为%d/n请输入选项 :",total);
break;
case 11: head = destory(head);break;
case 12: save(head);break;
case 13: head = read();break;
case 14: qiut();break;
default: printf("Usage :Input 1 to 12 :");break;
}
}
return 0;
}
//菜单
void menu(void)
{
printf("/t---欢迎使用学生信息管理系统 !---/n");
printf("-----------------------------------------------/n/n");
printf("***该系统可处理学生的学号,姓名,成绩信息***/n/n");
printf("/t1.菜单/n");
printf("/t2.创建信息/n");
printf("/t3.显示所有信息/n");
printf("/t4.查找信息/n");
printf("/t5.删除信息/n");
printf("/t6.插入信息/n");
printf("/t7.修改信息/n");
printf("/t8.信息排序/n");
printf("/t9.交换信息/n");
printf("/t10.显示信息数/n");
printf("/t11.销毁所有信息/n");
printf("/t12.保存信息/n");
printf("/t13.读入信息/n");
printf("/t14.退出系统/n");
printf("--------------------------------------------------/n");
printf(" 姜文峥/n");
printf(" 2011.1.28/n");
printf("/n/t请输入您的选项:");
}
//创建新链表
Stuif *create()
{
Stuif *head = NULL,*p = NULL,*tail = NULL;/*定义并初始化
头结点,当前节点,尾节点 */
printf("欢迎创建信息!/n");
//区别指针与数组,开辟空间来存储信息
p = (Stuif *)malloc(LEN); //创建表头
printf("成绩为-1时输入结束!/n请输入信息: ");
scanf("%s%s%f",p->id,p->name,&p->score);
p->next = NULL; // 及时初始化指针 !!!
if((int)p->score != OVER) //将成绩强制转换成整型
head = tail = p;
while((int)p->score != OVER ) //继续创建链表
{
p = (Stuif *)malloc(sizeof(LEN));
printf("请输入信息: ");
scanf("%s%s%f",p->id,p->name,&p->score);
p->next = NULL;
if((int)p->score != OVER)
{
tail->next = p; //连接
tail = p; //更新尾指针
}
}
printf("输入完毕/n请输入选项:");
return head;
}
//显示所有信息
void print(Stuif *head)
{
Stuif *p = head;
if(p == NULL)
printf("/n无任何信息!");
else
{
while(p != NULL)
{
printf("%s/t%s/t%.2f/n",p->id,p->name,p->score);
p = p->next;
}
}
printf("以显示完毕!/n请输入选项:");
}
//输入查找对象,并查找
void search_object(Stuif *head)
{
int isid; //判断查找模式
char s[MAX];
Stuif * search(Stuif *,char *,int);
if(head == NULL)
printf("无信息");
else
{
printf("学号查找请输入1,姓名查找请输入0 :");
scanf("%d",&isid);
switch(isid)
{
case 1:printf("请输入学号 :");break;
case 0:printf("请输入姓名:/n");break;
default:printf("输入错误,将按学号查/n");break;
}
scanf("%s",s);
search(head,s,isid); //将查找功能单列,更好
printf("请输入选项 :");
}
}
//查找
Stuif * search(Stuif *head,char *s,int isid)
{
Stuif *p = head;
for(p = head; p != NULL && //搜索
strcmp(s,isid ? p->id : p->name) != 0 ;p = p->next)
;
if(strcmp(s,isid ? p->id : p->name) == 0)
printf("查找成功,%s/t%s/t%.2f/n",p->id,p->name,p->score);
else
printf("无相关信息/n");
return p;
}
//输入删除并删除
Stuif * del_object(Stuif *head)
{
char s[MAX];
Stuif *del(Stuif *,char *);
printf("请输入删除者学号 :");
scanf("%s",s);
printf("删除成功./n请输入选项 :");
return del(head,s);
}
Stuif *del(Stuif *head,char *s)
{
Stuif *p = head,*pp = NULL;
if(p == NULL)
printf("无信息/n");
else
{
for(p = head; p != NULL &&
strcmp(s,p->id) != 0 ;p = p->next)
pp = p;
if(strcmp(s,p->id) == 0) //查找成功
{
if(p == head) //删除头结点
head = p->next;
else
pp->next = p->next; //删除尾节点或中间节点
free(p); //释放其原来所占空间
}
else //查找失败
printf("无相关信息!");
}
return head;
}
//输入插入对象,并插入
Stuif *insert_object(Stuif *head)
{
Stuif *p;
Stuif *insert(Stuif *,Stuif *);
p = (Stuif *)malloc(LEN);
if(p == NULL)
printf("无储存空间!请输入选项 :");
else
{
printf("请输入要插入的学生信息 :");
scanf("%s%s%f",p->id,p->name,&p->score);
p->next = NULL;
if((int)p->score != OVER)
printf("插入完毕,请输入选项 :");
return insert(head,p);
}
}
Stuif *insert(Stuif *head,Stuif *ins)
{
Stuif *p = head;
Stuif *pp = head;
if(p == NULL) //空指针
{
head = ins;
ins->next = NULL;
}
else //寻找插入位置
while(p->score > ins->score && p->next != NULL)
{
pp = p;
p = p->next;
}
if(p->score <= ins->score) //不要用p->next != NULL
if(p == head) //在头部插入
{
head = ins;
ins->next = p;
}
else //在中间插入
{
pp->next = ins;
ins->next = p;
}
else //在尾部插入
{
p->next = ins;
ins->next = NULL;
}
return head;
}
//修改
void modify(Stuif *head)
{
printf("请先删除,再重新插入");
}
//排序
Stuif *sort(Stuif *head)
{
Stuif *p = head;
int i,j;
int number = 0;
Stuif *swap(Stuif *,char *,char *);
number = count(head); //对于链表结构,不好用希尔排序或快排
for(i = 1; i < number; i++)
for(j = 0,p = head; j < number - i &&
p->next != NULL; j++)
{
if(p->score < p->next->score) //降序
head = swap(head,p->name,p->next->name);
else //保证指针一次遍历链表上各结点
p = p->next;
}
printf("排序完毕,请输入选项 :");
return head;
}
//交换
Stuif * swap_object(Stuif *head)
{
char name1[MAX],name2[MAX];
Stuif *swap(Stuif *,char *,char *);
printf("输入要交换的名字name1,name2(name1在前):");
scanf("%s%s",name1,name2);
head = swap(head,name1,name2);
return head;
printf("交换成功,请输入选项 :");
}
Stuif *swap(Stuif *head,char *name1,char *name2)
{
Stuif *p1,*pp1 = NULL,*pastp1; //前一个元素,当前元素,后一个元素
Stuif *p2,*pp2 = NULL,*pastp2;
if(head == NULL)
printf("无信息!/n");
else
{
for(p1 = head;p1 != NULL && //查找交换对象位置
strcmp(p1->name,name1) != 0;p1 = p1->next)
pp1 = p1;
for(p2 = head;p2 != NULL &&
strcmp(p2->name,name2) != 0;p2 = p2->next)
pp2 = p2;
if(strcmp(p1->name,name1) != 0 || strcmp(p2->name,name2) != 0)
printf("无相关信息!/n");
else //查找成功
{
if(p1->next == p2) //交换相邻元素
{
pastp2 = p2->next;
if(p1 == head)
head = p2;
else
pp1->next = p2;
p2->next= p1;
p1->next = pastp2;
}
else //交换非相邻元素
{
pastp1 = p1->next;
pastp2 = p2->next;
if(p1 == head) //若交换头结点
head = p2;
else
pp1->next = p2;
p2->next = pastp1;
pp2->next = p1;
p1->next = pastp2;
}
}
}
return head;
}
//计数
int count(Stuif *head)
{
Stuif *p = head;
int n = 0;
while(p != NULL)
{
n++;
p = p->next;
}
return n;
}
//销毁链表
Stuif *destory (Stuif *head)
{
Stuif *p = head,*pp = NULL;
if(p == NULL)
printf("无信息/n");
while(p != NULL)
{
pp = p->next;
free(p);
p = pp;
}
printf("已成功销毁所有信息/n");
printf("请输入选项 :");
return NULL;
}
//将链表中信息储存到硬盘
#define MAXFILE 30
void save(Stuif *head)
{
FILE *fp;
char fn[MAXFILE],c;
Stuif *p = head;
int update = 0; //判断是否更新
if(p == NULL)
printf("无信息可存!/n");
else
{
printf("是否覆盖原来信息(1/0):");
scanf("%d",&update);
printf("请输入储存信息文件的路径(例 d://jwzh//stu.txt):");
scanf("%s",fn);
fp = fopen(fn,update ? "w" : "a");
if(fp == NULL)
printf("文件打开失败!/n");
else
{
while(p != NULL)
{ //注意输入到文件中的格式
fprintf(fp,"%s/t%s/t%f/n",p->id,p->name,p->score);
p = p->next;
}
fclose(fp); //不要忘记关闭指针
}
printf("已成功保存至 %s/n请继续输入选项 :",fn);
}
}
//从硬盘中读入信息
Stuif *read()
{
FILE *fp;
Stuif *head = NULL,*p = NULL,*tail = NULL;
char fn[MAXFILE];
printf("请输入文件路径(例:d://jwzh//stu.txt) :");
scanf("%s",fn);
fp = fopen(fn,"r");
if(fp == NULL)
printf("文件打开失败!/n");
else
{
p = (Stuif *)malloc(LEN);
fscanf(fp,"%s/t%s/t%f/n",p->id,p->name,&p->score);
head = tail = p;
tail->next = NULL;
while(!feof(fp)) //判断文件读取是否结束
{
p = (Stuif *)malloc(LEN);
fscanf(fp,"%s/t%s/t%f/n",p->id,p->name,&p->score);
tail->next = p;
tail = p;
tail->next = NULL; //初始化指针
}
fclose(fp);
}
printf("已成功读取之内存/n请继续输入选项 :");
return head;
}
//退出系统
void qiut(void)
{
printf("已退出系统!/n");
exit(0);
}