学生管理系统（C++，控制台，文件读取，姓名排序）
这是一个用C++写的控制台程序，利用简单的菜单实现学生信息的管理。
简图如下所示：
菜单栏：
查询数据：
修改数据：
打印数据：
以下是添加了一些学生信息的进行一些操作的结果：
除了上面所展示的功能以外，还可以将所有的学生信息保存到一个txt文件中，或者将一个文件里面的学生信息读取进来，当然，读取的文件需要按照保存文件的格式进行排列。
在刚开始的时候我认为中文排序是最困难的，在经过很多网上资料的翻阅之后，终于找到了一个可行的方法。你可以百度一下pinyin.c了解一下这种中文排序的方法，这个文件里面是一个char类型的数组，有人将unicode码中从小到大的所有中文汉字的首字母依次存储到这个数组中，这意味着我们只需要获取这个中文汉字的unicode码就可以得到它的首字母，此时你就使用排序算法对字母转化而来的数值（ASCII码）进行排序就好了。由于我们平时使用的保存姓名都是用的字符串string类型，需要获得unicode码，还需要将它转化为wstring类型之后才能获取，这里我直接找到了一个函数将它转化。
下面我们还是来查看一下源代码：我是使用单链表实现的，不仅实现了一个链表类，该类还包含了一个简单的结构——节点。总有有三个文件
**⒈Linked_List.h **
#ifndef LINKED_LIST
#define LINKED_LIST
#include⒉Linked_List.cpp
#include "stdafx.h"
#include"Linked_List.h"
bool Linked_List::Is_Previous = true; //默认取指向前一个学生的指针
void Linked_List::Clear_Linked_List()
{
Node *p, *q;
p = this->Head_Point;
for (int i = 1; i <= this->Student_Count; i++)
{
//从头节点开始销毁，每次保存销毁节点的后一个节点，以便销毁其后的节点
q = p;
p = p->Next_Student;
delete q;
}
delete p; //创建的节点数目应该是头节点数加上学生数，所以这里最后还需要销毁最后一个学生信息
this->Student_Count = 0;
}
Linked_List::Linked_List(const Linked_List &list)
{
//实现两个链表的深拷贝
Node *q = list.Head_Point;
Linked_List *p = new Linked_List; //创建一个新的链表
Node *k = new Node;
for (int i = 1; i <= list.Student_Count; i++)
{
q = q->Next_Student;
p->Add_Student(q->Name, q->Student_ID, q->Gender, q->Age, q->Class, q->Health_Status);
}
}
void Linked_List::Print_Student_Details(string name)
{
Node *p = Find_Name(name);
if (p->Name != "NULL")
{
cout << "姓名" << " 学号" << " 性别" << " 年龄" << " 班级" << " 健康状况" << endl;
cout << left << setw(15) << setfill(' ') << p->Name;
cout << left << setw(12) << setfill(' ') << p->Student_ID;
cout << left << setw(8) << setfill(' ') << p->Gender;
cout << left << setw(10) << setfill(' ') << p->Age;
cout << left << setw(14) << setfill(' ') << p->Class;
cout << left << setw(18) << setfill(' ') << p->Health_Status << endl;
}
}
void Linked_List::Print_Student_Details(int studeng_id)
{
Node *p = Find_Student_Id(studeng_id);
if (p->Name != "NULL")
{
cout << "姓名" << " 学号" << " 性别" << " 年龄" << " 班级" << " 健康状况" << endl;
cout << left << setw(15) << setfill(' ') << p->Name;
cout << left << setw(12) << setfill(' ') << p->Student_ID;
cout << left << setw(8) << setfill(' ') << p->Gender;
cout << left << setw(10) << setfill(' ') << p->Age;
cout << left << setw(14) << setfill(' ') << p->Class;
cout << left << setw(18) << setfill(' ') << p->Health_Status << endl;
}
}
void Linked_List::Print_Every_Student()
{
Node *p;
p = Head_Point;
cout << "姓名" << " 学号" << " 性别" << " 年龄" << " 班级" << " 健康状况" << endl;
for (int i = 1; i <= Student_Count; i++)
{
p = p->Next_Student;
cout << left << setw(15) << setfill(' ') << p->Name;
cout << left << setw(12) << setfill(' ') << p->Student_ID;
cout << left << setw(8) << setfill(' ') << p->Gender;
cout << left << setw(10) << setfill(' ') << p->Age;
cout << left << setw(14) << setfill(' ') << p->Class;
cout << left << setw(18) << setfill(' ') << p->Health_Status << endl;
}
}
void Linked_List::Add_Student(string name)
{
Node *p = Head_Point;
Node *q = new Node(name);
Student_Count++;
if (Student_Count == 1)
{
Head_Point->Next_Student = q;
}
else
{
for (int i = 1; i < Student_Count; i++)
{
p = p->Next_Student;
}
}
p->Next_Student = q;
return;
}
void Linked_List::Add_Student(string name, int student_id, string gender, int age, string Class, string health_status)
{
Node *p = Head_Point;
Node *q = new Node(name, student_id, gender, age, Class, health_status);
//创建一个节点并将它与链表连接
Student_Count++;
for (int i = 1; i < Student_Count; i++)
{
p = p->Next_Student;
}
p->Next_Student = q;
return;
}
int Linked_List::Show_Print_Menu()
{
for (; 1;) //进行一些操作之后便于快速跳出该菜单
{
system("cls");
cout << " ┎┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┒" << endl;
cout << " ┋ 学生教务管理系统 ┋" << endl;
cout << " ┋ ①姓名排序 ②学号排序 ┋" << endl;
cout << " ┋ ③添加顺序 ④返回菜单 ┋" << endl;
cout << " ┋ ┋" << endl;
cout << " ┖┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┚" << endl;
cout << "请输入相应操作前面的序号：";
int Operation_Number;
cin >> Operation_Number;
if (Operation_Number == 4)
{
system("cls"); //清空控制台的显示
break;
}
if (Operation_Number == 3)
{
Print_Every_Student();
system("pause"); //显示打印结果，等待我们按任意键再进入到菜单选项
}
if (Operation_Number == 2)
{
Linked_List Id_Sort;
Id_Sort = *this; //调用赋值构造函数
Id_Sort.Student_Id_Sort();
Id_Sort.Print_Every_Student();
Id_Sort.Clear_Linked_List(); //打印完成之后销毁排好序的链表
system("pause");
}
if (Operation_Number == 1)
{
Linked_List Name_Sort;
Name_Sort = *this;
Name_Sort.Student_Name_Sort();
Name_Sort.Print_Every_Student();
Name_Sort.Clear_Linked_List();
system("pause");
}
}
return 0;
}
int Linked_List::Show_Main_Menu() //子菜单的跳转
{
for (; 1;)
{
cout << " ┎┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┒" << endl;
cout << " ┋ 学生教务管理系统 ┋" << endl;
cout << " ┋ ①查询数据 ②修改数据 ┋" << endl;
cout << " ┋ ③打印数据 ④退出系统 ┋" << endl;
cout << " ┋ ┋" << endl;
cout << " ┖┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┚" << endl;
cout << "请输入相应操作前面的序号：";
int Operation_Number;
cin >> Operation_Number;
if (Operation_Number == 4)
{
exit(1); //退出程序
}
if (Operation_Number == 3)
{
Show_Print_Menu();
continue; //从上一个菜单退出之后，重新开始主菜单栏的显示
}
if (Operation_Number == 2)
{
Show_Edit_Menu();
continue;
}
if (Operation_Number == 1)
{
Show_Query_Menu();
continue;
}
}
return 0;
}
int Linked_List::Show_Query_Menu()
{
bool Is_Back = false;
for (; 1;)
{
system("cls");
cout << " ┎┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┒" << endl;
cout << " ┋ 学生教务管理系统 ┋" << endl;
cout << " ┋ ①姓名查询 ②学号查询 ┋" << endl;
cout << " ┋ ③返回菜单 ┋" << endl;
cout << " ┋ ┋" << endl;
cout << " ┖┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┚" << endl;
cout << "请输入相应操作前面的序号：";
int Operation_Number;
cin >> Operation_Number;
if (Operation_Number == 3)
{
system("cls");
break;
}
else if (Operation_Number == 2)
{
Is_Previous = false; //查询指向当前的节点
cout << "请输入学生学号：";
int student_id;
cin >> student_id;
Print_Student_Details(student_id);
system("pause");
}
else if (Operation_Number == 1)
{
Is_Previous = false; //查询指向当前的节点
cout << "请输入学生姓名：";
string name;
cin >> name;
// cout << "找到学生信息如下：" << endl;
Print_Student_Details(name);
system("pause");
}
else
{
cout << "你的输入有误，请重新输入！";
system("pause");
}
}
return 0;
}
int Linked_List::Show_Edit_Menu()
{
for (; 1;)
{
system("cls");
cout << " ┎┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┒" << endl;
cout << " ┋ 学生教务管理系统 ┋" << endl;
cout << " ┋ ①增加学生 ②删除学生 ┋" << endl;
cout << " ┋ ③编辑学生 ④返回菜单 ┋" << endl;
cout << " ┋ ┋" << endl;
cout << " ┖┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┉┚" << endl;
cout << "请输入相应操作前面的序号：";
int Operation_Number;
cin >> Operation_Number;
if (Operation_Number == 4)
{
system("cls");
break;
}
if (Operation_Number == 3)
{
Is_Previous = false; //编辑学生信息需要指向当前学生
Edit_Student();
system("pause");
}
if (Operation_Number == 2)
{
Is_Previous = true; //如果要删除一个学生，需要指向他前一个学生，才能进行指针的修改
Delete_Student();
system("pause");
}
if (Operation_Number == 1)
{
Is_Previous = false;
string name;
cout << "请你输入将要添加的学生姓名：";
cin >> name;
Add_Student(name);
cout << "添加成功!添加的信息如下：" << endl;
Print_Student_Details(name);
system("pause");
}
}
return 0;
}
Node* Linked_List::Find_Name(string name)
{
int i;
Node *k = Head_Point;
Node *q, *t;
q = Head_Point;
t = Head_Point;
for (i = 0; i < Student_Count; i++)
{
t = q;
q = q->Next_Student;
if (q->Name == name)
{
if (Is_Previous)return t; //返回指向前一个学生的指针
else break; //返回指向当前学生的指针
}
}
if (i == Student_Count) //如果所有节点遍历完都还没有找到这个学生就进行以下操作
{
cout << "学生管理系统中并没有登记过该学生！" << endl;
return k; //没有找到就返回头节点，因为头节点的数据是NULL，可以对它的Name等属性进行判断知道是否找到
}
return q;
}
Node* Linked_List::Find_Student_Id(int studeng_id)
{
int i;
Node *k = Head_Point;
Node *q, *t;
q = Head_Point;
t = Head_Point;
for (i = 0; i <Student_Count; i++)
{
t = q;
q = q->Next_Student;
if (q->Student_ID == studeng_id)
{
if (Is_Previous)return t;
else break;
}
}
if (i == Student_Count)
{
cout << "学生管理系统中并没有登记过该学生！" << endl;
return k;
}
return q;
}
void Linked_List::Delete_Student()
{
char Operator_char;
string name;
cout << "请输入你想删除的学生姓名：";
cin >> name;
Node *p = Find_Name(name);
Is_Previous = false;
Print_Student_Details((p->Next_Student->Name));
//显示学生信息确定是否要删除
for (; 1;)
{
cout << "你确定要删除该学生？(Y确认N取消)" << endl;
cin >> Operator_char;
if (Operator_char == 'Y' || Operator_char == 'y')
{
Student_Count--;
if (p->Next_Student != NULL)
p->Next_Student = p->Next_Student->Next_Student;
else
{
p->Next_Student = NULL;
}
cout << "你已经成功删除该学生！";
break;
}
else if (Operator_char == 'N' || Operator_char == 'n')
{
cout << "你已经成功取消该操作！";
break;
}
else
{
cout << "你的输入有误，请重新输入!";
}
}
return;
}
void Linked_List::Edit_Student()
{
string name;
cout << "请你输入想要修改的学生姓名：";
cin >> name;
Node *now = new Node;
Node *p = Find_Name(name);
cout << "请你输入修改后的名字：";
cin >> now->Name;
cout << endl;
if (now->Name != "NULL")
{
p->Name = now->Name;
}
cout << "请你输入修改后的学号：";
cin >> now->Student_ID;
cout << endl;
if (now->Student_ID != NULL)
{
p->Student_ID = now->Student_ID;
}
cout << "请你输入修改后的性别：";
cin >> now->Gender;
cout << endl;
if (now->Gender != "NULL")
{
p->Gender = now->Gender;
}
cout << "请你输入修改后的年龄：";
cin >> now->Age;
cout << endl;
if (now->Age != NULL)
{
p->Age = now->Age;
}
cout << "请你输入修改后的班级：";
cin >> now->Class;
cout << endl;
if (now->Class != "NULL")
{
p->Class = now->Class;
}
cout << "请你输入修改后的健康状况：";
cin >> now->Health_Status;
cout << endl;
if (now->Health_Status != "NULL")
{
p->Health_Status = now->Health_Status;
}
cout << "修改后的学生情况如下："<<endl;
Print_Student_Details(name);
delete now;
}
void Linked_List::Student_Id_Sort()
{
//冒泡排序法对学号进行排序，主要是指针间的关系改动
int j = 0;
Node *k;
Node *p;
Node *q;
for (int i = 0; i < Student_Count - 1; i++)
{
k = Head_Point;
p = Head_Point->Next_Student;
q = Head_Point->Next_Student->Next_Student;
for (j = 0; j < Student_Count - 1 - i; j++)
{
if (p->Student_ID > q->Student_ID)
{
k->Next_Student = q;
p->Next_Student = q->Next_Student;
q->Next_Student = p;
k = k->Next_Student;
q = p->Next_Student;
}
else
{
k = k->Next_Student;
p = p->Next_Student;
q = q->Next_Student;
}
}
}
}
void Linked_List::Student_Name_Sort()
{
int j = 0;
Node *k;
Node *p;
Node *q;
for (int i = 0; i < Student_Count - 1; i++)
{
k = Head_Point;
p = Head_Point->Next_Student;
q = Head_Point->Next_Student->Next_Student;
for (j = 0; j < Student_Count - 1 - i; j++)
{
int a = Get_First_Pinyin(p->Name);
int b = Get_First_Pinyin(q->Name);
if (a> b)
{
k->Next_Student = q;
p->Next_Student = q->Next_Student;
q->Next_Student = p;
k = k->Next_Student;
q = p->Next_Student;
}
else
{
k = k->Next_Student;
p = p->Next_Student;
q = q->Next_Student;
}
}
}
}
Linked_List& Linked_List::operator=(const Linked_List &list)
{
//类似于拷贝构造函数
Linked_List *p = new Linked_List;
Head_Point = p->Head_Point;
Node *k = list.Head_Point;
for (int i = 1; i <= list.Student_Count; i++)
{
k = k->Next_Student;
p->Add_Student(k->Name, k->Student_ID, k->Gender, k->Age, k->Class, k->Health_Status);
}
Student_Count = p->Student_Count;
return *this;
}
⒊main.cpp
这里面都是一些测试代码：
#include "stdafx.h"
#include"Linked_List.h"
#include单链表作为一种数据结构，而学生管理系统只是它的一种应用。当我完成这个管理系统之后，领悟最多的还是关于C++的类的实现，指针的使用，很多东西，自己去做了一遍才知道问题在哪里。不动手是不会知道自己是否可以实现一些事情的，努力去做才会有好事发生。