题目;实现一个学生信息管理系统,学生信息为如下表格,系统功能要求对学生信息进行录入,显示,插入一个新学生信息,删除一个学生,并实现按学号查找某学生信息。
例:现有一学生学籍信息表,该表包含如下学生信息:学号num、姓名name、年龄age、是否退学 LeaveSch。该信息表主要用于查询学生学籍信息,如有新生入学,则在表尾加入新生信息,将其LeavSch字段设为“N”:如有学生退学,则将其LeavSch字段设为
实现代码:
#include#include using namespace std; struct Student {//创建一个学生结构体 string num; string name; string age; string LeaveSch; }; typedef struct node//定义学生节点 { struct Student data; struct node *next; } Node; Node L; int a; int showM() {//显示菜单和返回选择 cout << "请选择要操作的功能" << endl; cout << "1 添加一个学生" << endl; cout << "2 删除一个学生" << endl; cout << "3 按学号查找一个学生" << endl; cout << "4 显示学生" << endl; while (1) { cin >> a; if (a >= 0 && a <= 4) { return a; } else cout << "输入错误请重新输入" << endl; } } void showStudent() { Node *p = L.next; while (1) { if(p!=NULL) cout << "学号:" << p->data.num << " 姓名:" << p->data.name << " 年龄:" << p->data.age << " 是否在校:" << p->data.LeaveSch << endl; else break; if (p->next ==NULL) break; else p = p->next; } return; } void addStudent() { Node *p; p = new Node; cin >> p->data.num >> p->data.name >> p->data.age >> p->data.LeaveSch; p->next = NULL; Node *q=&L; while (1) { if (q->next!= NULL) { q = q->next; } else break; } q->next= p; return ; } void deleteStudent() { string name; cout << "请输入要删除的学生姓名" << endl; cin >> name; Node *p = L.next; while(1) { if (p==NULL) { cout << "你输入的姓名不存在" << endl; break; } if (p->data.name == name) { if (p->next == NULL) { free(p); break; } else{ Node *q = p->next; p->data.num = q->data.num; p->data.name = q->data.name; p->data.age = q->data.age; p->data.LeaveSch = q->data.LeaveSch; p->next = q->next; free(q); break; } } p = p->next; } } void selectstudent() {//按照学号查找一个学生 string no; cout << "请输入要查找的学生序号" << endl; cin >> no; Node *p = L.next; while (1) { if (p == NULL) { cout << "你输入的学号不存在" << endl; break; } if (p->data.num == no) { cout << "学号:" << p->data.num << " 姓名:" << p->data.name << " 年龄:" << p->data.age << " 是否在校:" << p->data.LeaveSch << endl; break; } p = p->next; } } int main() { L.next = NULL; while (1) { switch (showM()) { case 1: addStudent(); break;//添加一个学生 case 2: deleteStudent();break; case 3: selectstudent(); break; case 4: showStudent(); break; //显示所有学生 case 0: cout << "欢迎下次使用" << endl; exit(0); break; } } return 0; }
具体报告链接:https://download.csdn.net/download/qing_shi/29626945



