学生成绩管理系统(c++链表)

下面是程序实现的功能:
在这里插入图片描述
程序中将5门课程定为:语文、数学、英语、物理、化学

下面是程序的运行截图:
在这里插入图片描述
话不多说!直接上代码!!!

#include <iostream>
#include <string>
#include <iomanip>
#include <fstream>
#define MAX 1005

using namespace std;
class stud
{
private:
	typedef struct Node
	{
		string numebr;	//学号
		string name;	//姓名
		string sex;		//性别
		int age;		//年龄
		double score[5];	//五门成绩,假定为语数英物化
		double sum;		//总成绩
		struct Node *next;
	}node,*list;
	list head = new node;
	int sum;
public:
	stud()
	{
		sum = 0;
	}
	~stud() {}
	//初始化
	void Init()
	{
		head->next = NULL;
	}
	//创建链表
	void Create()
	{
		list p = head;
		ifstream read("student.txt");
		if (!read)
		{
			cout << "文件打开失败!退出系统!\n";
			exit(0);
		}
		while (!read.eof())
		{
			list s = new node;
			read >> s->numebr >> s->name >> s->sex >> s->age;
			if (s->age >= 0 && s->age <= 200)
			{
				sum++;
			}
			s->sum = 0;
			for (int i = 0; i < 5; i++)
			{
				read >> s->score[i];
				s->sum += s->score[i];
			}
			s->next = NULL;
			p->next = s;
			p = p->next;
		}
		read.close();
	}
	//满返回1
	bool Full()
	{
		return (sum < MAX ? 0 : 1);
	}
	//空返回1
	bool Empty()
	{
		return (sum == 0 ? 1 : 0);
	}
	//销毁
	void Destroy()
	{
		list p = head->next, q = NULL;
		while (p)
		{
			q = p->next;
			delete p;
			p = q;
		}
		if (head)
		{
			delete head;
			head = NULL;
		}
	}
	//保存到文本中
	void write()
	{
		ofstream Str("student.txt", ios_base::trunc);
		if (!Str)
		{
			printf("文件存入失败!\n");
			return;
		}
		list p = head->next;
		while (p)
		{
			Str << p->numebr << " " << p->name << " " << p->sex << " " << p->age<<" ";
			for (int i = 0; i < 4; i++)
			{
				Str << p->score[i] << " ";
			}
			Str << p->score[4] ;
			if (p->next)
			{
				Str << endl;
			}
			p = p->next;
		}
		Str.close();
	}
	//按学号查询
	bool query(string n)
	{
		list p = head->next;
		while (p)
		{
			if (p->numebr == n)
			{
				cout << "学号    姓名    性别    年龄    数学    语文    英语    物理    化学\n";
				cout << setiosflags(ios::fixed) << setprecision(10) << p->numebr
				<<"	"<< setiosflags(ios::fixed) << setprecision(10) << p->name
				<<"	"<< setiosflags(ios::fixed) << setprecision(10) << p->sex
				<<"	"<< setiosflags(ios::fixed) << setprecision(6) << p->age
					<<"	"<< setiosflags(ios::fixed) << setprecision(2) << p->score[0]
					<<"	"<< setiosflags(ios::fixed) << setprecision(2) << p->score[1]
					<<"	"<< setiosflags(ios::fixed) << setprecision(2) << p->score[2]
					<<"	"<< setiosflags(ios::fixed) << setprecision(2) << p->score[3]
					<<"	"<< setiosflags(ios::fixed) << setprecision(2) << p->score[4] << endl;
				return 1;
			}
			p = p->next;
		}
		return 0;
	}
	//添加信息
	void add()
	{
		if (Full())
		{
			cout << "当前人数已达上限!\n";
			return;
		}
		list s=new node;
		string n;
		cout << "请输入学号:";
		cin >> n;
		if (query(n))
		{
			cout << "该学号已存在!\n";
		}
		else
		{
			s->numebr = n;
			cout << "请输入姓名:";
			cin >> s->name;
			cout << "请输入性别:";
			cin >> s->sex;
			cout << "请输入年龄:";
			cin >> s->age;
			cout << "请输入语数英物化:" << endl;
			s->sum = 0;
			for (int i = 0; i < 5; i++)
			{
				cin >> s->score[i];
				s->sum += s->score[i];
			}
			cout << "添加成功!\n";
			s->next = NULL;
			list p = head;
			while (p->next)
			{
				p = p->next;
			}
			p->next = s;
			sum++;
		}
	}
	//删除信息
	void del()
	{
		if (Empty())
		{
			cout << "当前无学生信息,无法删除!\n";
			return;
		}
		string n;
		cout << "请输入学号:";
		cin >> n;
		list p =head,q;
		bool flag=0;
		while(p->next)
		{
			if (p->next->numebr == n&&p->next->next)
			{
				q = p->next;
				p->next = p->next->next;
				delete q;
				flag = 1;
			}
			else if(p->next->numebr == n&& p->next->next==NULL)
			{ 
				q = p->next;
				p->next = NULL;
				delete q;
				flag = 1;
				break;
			}
			p = p->next;
		}
		if (flag)
		{
			sum--;
			cout << "删除成功!\n";
		}
		else
		{
			cout << "该学号不存在!无法删除!\n";
		}
	}
	//显示人数
	void people()
	{
		cout << "当前学生人数:" << sum << "人" << endl;
	}
	//修改年龄
	void modify()
	{
		string n;
		cout << "请输入学号:";
		cin >> n;
		list p = head->next;
		bool flag = 0;
		while (p)
		{
			if (p->numebr == n)
			{
				cout << "请输入年龄:";
				int ag;
				cin >> ag;
				p->age = ag;
				flag = 1;
			}
			p = p->next;
		}
		if (flag)
		{
			cout << "修改成功!\n";
		}
		else
		{
			cout << "不存在该学号,无法修改!\n";
		}
	}
	//男女人数
	void pe()
	{
		int nan = 0, nv = 0;
		list p = head->next;
		while (p)
		{
			if (p->sex == "男") nan++;
			else if (p->sex == "女") nv++;
			p = p->next;
		}
		cout << "男生人数:" << nan << endl;
		cout << "女生人数:" << nv << endl;
	}
	//按总成绩从小到大排序
	void display()
	{
		if (Empty())
		{
			cout << "暂无学生信息!\n";
			return;
		}
		list p = NULL;
		list q = NULL;
		list s = NULL;
		while (head->next != s)
		{
			p = head;
			q = head->next;
			while (q->next != s)
			{
				if (q->sum > q->next->sum)
				{
					p->next = q->next;
					q->next = q->next->next;
					p->next->next = q;
					q = p->next;
				}
				q = q->next;
				p = p->next;
			}
			s = q;
		}
		cout << "学号       姓名       总分数\n";
		p = head->next;
		while (p)
		{
			cout << setiosflags(ios::fixed)<< p->numebr <<setw(7)
				<< " " << setiosflags(ios::fixed)  << p->name << setw(7)
				<< " " << setiosflags(ios::fixed) << setprecision(2) << p->sum << endl;
			p = p->next;
		}
	}
	//显示学生信息
	void show()
	{
		list p = head->next;
		cout << "学号    姓名    数学    语文    英语    物理    化学    总分数  平均分\n";
		while (p)
		{
			cout << setiosflags(ios::fixed) << setprecision(10) << p->numebr
				<< "	" << setiosflags(ios::fixed) << setprecision(10) << p->name
				<< "	" << setiosflags(ios::fixed) << setprecision(2) << p->score[0]
				<< "	" << setiosflags(ios::fixed) << setprecision(2) << p->score[1]
				<< "	" << setiosflags(ios::fixed) << setprecision(2) << p->score[2]
				<< "	" << setiosflags(ios::fixed) << setprecision(2) << p->score[3]
				<< "	" << setiosflags(ios::fixed) << setprecision(2) << p->score[4]
				<< "	" << setiosflags(ios::fixed) << setprecision(2) << p->sum
				<< "	" << setiosflags(ios::fixed) << setprecision(2) << p->sum/5 << endl;

			p = p->next;
		}
	}
	//某课的最高分
	void high()
	{
		char select;
		cout << "1、语文\n";
		cout << "2、数学\n";
		cout << "3、英语\n";
		cout << "4、物理\n";
		cout << "5、化学\n";
		cout << "请选择\n";
		cin >> select;
		if (select > '5'&&select < '1')
		{
			cout << "选择错误!\n";
		}
		else
		{
			float max_score=0;
			list p = head;
			while (p)
			{
				if (p->score[select - '0' - 1] > max_score)
				{
					max_score = p->score[select - '0' - 1];
				}
				p = p->next;
			}
			p = head->next;
			cout << "学号       姓名       分数\n";
			while (p)
			{
				if (p->score[select - '0' - 1] == max_score)
				{
					cout << setiosflags(ios::fixed) << p->numebr << setw(7)
						<< " " << setiosflags(ios::fixed) << p->name << setw(7)
						<< " " << setiosflags(ios::fixed) << setprecision(2) << p->score[select - '0' - 1] << endl;
				}
				p = p->next;
			}
		}
	}
	//菜单
	void menu()
	{
		char s;
		cout << "1、添加学生信息\n";
		cout << "2、删除学生信息\n";
		cout << "3、修改学生信息\n";
		cout << "4、查询学生信息\n";
		cout << "5、统计学生信息\n";
		cout << "6、各科优秀学生\n";
		cout << "7、学生信息排名\n";
		cout << "8、男女人数信息\n";
		cout << "0、退出系统\n";
		cout << "请选择(0-8):";
		cin >> s;
		switch (s)
		{
		case '0':
			cout << "欢迎下次使用!\n";
			Destroy();
			exit(0);
			break;
		case '1':
			add();
			write();
			people();
			break;
		case '2':
			del();
			write();
			people();
			break;
		case '3':
			modify();
			write();
			break;
		case '4':
		{
			cout << "请输入要查询的学号" << endl;
			string n;
			cin >> n;
			if (query(n))
			{
				cout << "查询成功!\n";
			}
			else
			{
				cout << "该学号不存在!\n";
			}
			break;
		}
		case '5':
			show();
			break;
		case '6':
			high();
			break;
		case '7':
			display();
			break;
		case '8':
			pe();
			break;
		default:
			cout << "选择错误!请重新选择!\n";
			break;
		}
		system("pause");
		system("cls");
	}
};

int main()
{
	stud st;
	st.Init();
	st.Create();
	st.people();
	cout << "欢迎使用!\n";
	system("pause");
	system("cls");
	while (1)
	{
		st.menu();
	}
	return 0;
}

  • 7
    点赞
  • 33
    收藏
    觉得还不错? 一键收藏
  • 6
    评论
学生成绩管理系统使用C++链表结构可以有效地存储和管理大量的学生信息,因为链表数据结构具有动态性和灵活性,能够方便地添加、删除和修改元素。以下是使用C++链表实现学生成绩管理系统一个简单概述: 1. **定义节点结构**: 定义一个`StudentNode`类,包含学生的基本属性(如ID、姓名、成绩等)以及指向下一个节点的指针。 ```cpp class StudentNode { public: int id; string name; double score; StudentNode* next; }; ``` 2. **链表头结点**: 创建一个`StudentList`类,包含一个指向链表头结点的指针,并可能包含一些辅助方法,如初始化、查找、插入、删除等。 ```cpp class StudentList { private: StudentNode* head; public: StudentList(); ~StudentList(); // 插入新学生 void insertStudent(StudentNode* newNode); // 删除学生 void deleteStudent(int id); // 查找学生 bool findStudent(int id, StudentNode*& node); }; ``` 3. **核心操作**: - `insertStudent`: 在链表末尾插入新的学生节点。 - `deleteStudent`: 根据学生的ID找到并删除对应节点。 - `findStudent`: 查找特定ID的学生,如果找到返回节点,否则返回false。 ```cpp // 实现插入、删除和查找的方法 void StudentList::insertStudent(StudentNode* newNode) { if (!head) { head = newNode; } else { StudentNode* current = head; while (current->next) { current = current->next; } current->next = newNode; } } bool StudentList::findStudent(int id, StudentNode*& node) { if (!head) return false; StudentNode* current = head; while (current && current->id != id) { current = current->next; } node = current; return current != nullptr; } // 删除方法 void StudentList::deleteStudent(int id) { if (!head) return; if (head->id == id) { StudentNode* temp = head; head = head->next; delete temp; return; } StudentNode* current = head; while (current->next && current->next->id != id) { current = current->next; } if (current->next) { current->next = current->next->next; delete current->next; } } ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 6
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值