#include "main.h"
int main() {
struct Node *head = (struct Node *) malloc(sizeof(struct Node));
head->next = NULL;
char i;
while (1) {
printf("------------------\n");
printf("1.添加\n");
printf("2.查看\n");
printf("3.删除\n");
printf("4.修改\n");
printf("5.查询\n");
printf("6.排序\n");
printf("0 退出系统\n");
printf("------------------\n");
scanf("%c", &i);
fflush(stdin);
if (i == '1') addStu(head, scanner());
else if (i == '2') ergodicStu(head);
else if (i == '3') delStu(head);
else if (i == '4') updateStu(head);
else if (i == '5') searchManu(head);
else if (i == '6') sortManu(head);
else if (i == '0') return 0;
else printf("输入有误，请重试！\n");
}
}
void addStu(struct Node *head, struct Student *p) {
if (head->next == NULL) {
head->next = p;
} else {
struct Student *temp = head->next;
while (temp->next != NULL) temp = temp->next;
temp->next = p;
}
}
struct Student *scanner() {
struct Student *p = (struct Student *) malloc(sizeof(struct Student));
int ifLegal;
do {
printf("请输入学生的姓名:\n");
ifLegal = scanf("%s", p->name);
fflush(stdin);
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
do {
printf("请输入学生的年龄:\n");
ifLegal = scanf("%d", &p->age);
fflush(stdin);
if (p->age <= 0) ifLegal = 0;
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
do {
printf("请输入学生的学号:\n");
ifLegal = scanf("%d", &p->num);
fflush(stdin);
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
do {
printf("请输入学生的班级:\n");
ifLegal = scanf("%d", &p->class);
fflush(stdin);
if (p->class <= 0) ifLegal = 0;
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
do {
printf("请输入高数成绩:\n");
ifLegal = scanf("%f", &p->score[0]);
fflush(stdin);
if (p->score[0] <= 0) ifLegal = 0;
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
do {
printf("请输入英语成绩:\n");
ifLegal = scanf("%f", &p->score[1]);
fflush(stdin);
if (p->score[1] <= 0) ifLegal = 0;
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
do {
printf("请输入数据结构成绩:\n");
ifLegal = scanf("%f", &p->score[2]);
fflush(stdin);
if (p->score[2] <= 0) ifLegal = 0;
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
p->total = p->score[0] + p->score[1] + p->score[2];
p->ave = p->total / 3.0f;
p->next = NULL;
return p;
}
void ergodicStu(struct Node *head) {
if (head->next == NULL) {
printf("无数据\n");
return;
}
struct Student *temp = head->next;
printf("姓名\t年龄\t学号\t班级\t高数\t\t英语\t\t数据结构\t平均分\t总分\n");
while (temp != NULL) {
printf("%s\t%d\t%d\t%d\t%.2f\t%.2f\t%.2f\t%.2f\t%.2f\n", temp->name, temp->age, temp->num, temp->class,
temp->score[0], temp->score[1], temp->score[2], temp->ave, temp->total);
temp = temp->next;
}
}
void delStu(struct Node *head) {
int ifLegal;
int num;
do {
printf("请输入待删除同学的学号:");
ifLegal = scanf("%d", &num);
fflush(stdin);
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
if (head->next == NULL) {
printf("数据不存在！\n");
return;
}
if (head->next->num == num) {
head->next = head->next->next;
printf("删除成功！\n");
return;
}
struct Student *temp = head->next;
while (temp->next != NULL) {
if (temp->next->num == num) {
temp->next = temp->next->next;
printf("删除成功！\n");
return;
}
temp = temp->next;
}
printf("数据不存在！\n");
}
void updateStu(struct Node *head) {
int num;
int ifLegal;
do {
printf("请输入待修改同学的学号:");
ifLegal = scanf("%d", &num);
fflush(stdin);
if (ifLegal == 0) printf("输入不合法！请重新输入\n");
} while (!ifLegal);
if (head->next == NULL) {
printf("数据不存在！\n");
return;
}
struct Student *p = NULL;
if (head->next->num == num) {
p = scanner();
p->next = head->next->next;
head->next = p;
printf("修改成功！\n");
return;
}
struct Student *temp = head->next;
while (temp->next != NULL) {
if (temp->next->num == num) {
p = scanner();
p->next = temp->next->next;
temp->next = p;
printf("修改成功！\n");
return;
}
temp = temp->next;
}
printf("数据不存在！\n");
}
void sortManu(struct Node *head) {
if (head->next == NULL) {
printf("无数据\n");
return;
}
printf("------------------\n");
printf("1.姓名排序\n");
printf("2.学号排序\n");
printf("3.班级排序\n");
printf("4.高数成绩排序\n");
printf("5.英语成绩排序\n");
printf("6.数据结构成绩排序\n");
printf("7.平均成绩排序\n");
printf("8.总成绩排序\n");
printf("------------------\n");
char i;
scanf("%c", &i);
fflush(stdin);
if (i == '1') sortBy(head, ifName);
else if (i == '2') sortBy(head, ifNum);
else if (i == '3') sortBy(head, ifClass);
else if (i == '4') sortBy(head, ifScore0);
else if (i == '5') sortBy(head, ifScore1);
else if (i == '6') sortBy(head, ifScore2);
else if (i == '7') sortBy(head, ifAve);
else if (i == '8') sortBy(head, ifTotal);
else printf("输入有误，请重试！\n");
}
void sortBy(struct Node *head, int(*pFun)(struct Student *)) {
for (struct Student *p = head->next; p != NULL; p = p->next) {
for (struct Student *q = p; q->next != NULL; q = q->next) {
if (pFun(q)) {
char name[25];
int age;
int num;
int class;
float score[3];
float total;
float ave;
strcpy(name, q->name);
strcpy(q->name, q->next->name);
strcpy(q->next->name, name);
age = q->age;
q->age = q->next->age;
q->next->age = age;
num = q->num;
q->num = q->next->num;
q->next->num = num;
class = q->class;
q->class = q->next->class;
q->next->class = class;
score[0] = q->score[0];
q->score[0] = q->next->score[0];
q->next->score[0] = score[0];
score[1] = q->score[1];
q->score[1] = q->next->score[1];
q->next->score[1] = score[1];
score[2] = q->score[2];
q->score[2] = q->next->score[2];
q->next->score[2] = score[2];
total = q->total;
q->total = q->next->total;
q->next->total = total;
ave = q->ave;
q->ave = q->next->ave;
q->next->ave = ave;
}
}
}
ergodicStu(head);
}
int ifName(struct Student *q) {
return strcmp(q->name, q->next->name) <= 0;
}
int ifScore0(struct Student *q) {
return q->score[0] < q->next-
