C++作业

最新推荐文章于 2025-06-04 18:39:50 发布

原创最新推荐文章于 2025-06-04 18:39:50 发布 · 277 阅读

0 ·

CC 4.0 BY-SA版权

c++作业专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个使用C++实现的学生信息管理系统，该系统通过继承的方式定义了本科生和研究生类，并利用模板类实现了链表来存储和管理学生信息。系统支持创建不同类型的学生记录并显示其详细信息。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<string>
using namespace std;
class Student
{
public:
	virtual void get()=0;
	virtual void display()=0;
	string name;
	int num;
};
class UnderGraduate :public Student//本科生
{
public:
	void get()
	{
		cout << "姓名:"; cin >> name;
		cout << "学号:"; cin >> num; 
		cout << "班级号："; cin >> classnum;
	}
	void display();
private:
	int classnum;
};
class Graduate :public Student//研究生
{
public:
	void get()
	{
		cout << "姓名:"; cin >> name;
		cout << "学号:"; cin >> num;; 
		cout << "导师姓名:"; cin >> Tutor;
	}
	void display();
private:
	string Tutor;
};
void UnderGraduate::display()
{
	cout << "姓名:" << name;
	cout << "学号:"<< num;
	cout << "班级号:" <<classnum<<endl;
}
void Graduate::display()
{
	cout << "姓名:"<< name;
	cout << "学号:"<< num;
	cout << "导师姓名:"<<Tutor;
}
template <typename T>
class SList;

template <typename T>
class Node
{
	friend class SList<T>;
public:
	Node(T *data) :data(data), next(NULL){}
private:
	T *data;
	Node<T> *next;
};
template < typename T>
class SList
{
public:
	SList():head(NULL), tail(NULL){}
	void Insert(T *newNode)
	{	
		Node<T> *t = new Node<T>(newNode);	
		if (!head)	
		{		
			head = tail = t;		
			length++;	
		}	
		else	
		{	
			tail->next = t;		
			tail = t;		
			length++;		
		}
	}
	void Delete()
	{	
		Node<T> *t = head;	
		head = head->next;	
		delete t;
	}
	void Print()
	{	
		if (!head)	
		{		
			cout << "链表空..." << endl;		
			return;	
		}
		Node<T> *t;	
		for (t = head; t; t = t->next)	
		{		
			t->data->display();	
		}
	}
private:
	int length;
	Node<T> *head;
	Node<T> *tail;
};

int main()
{
	char c; UnderGraduate U; Graduate G;
	SList<Student> List;
	for (;;)
	{
		cout << "创建学生:类型（U）本科生,（G）研究生,（E）结束：";
		cin >> c;
		if (c == 'E'){ cout << "销毁链表."<<endl; break; }
		else if (c == 'U' || c == 'G')
			switch (c)
			{
			case 'U':U.get(); List.Insert(&U); break;
			case 'G':G.get(); List.Insert(&G); break;
			default: break;
			}		
		else cout << "输入无效请重新输入:" << endl;
	}
	List.Print();
	List.Delete();
	List.Delete();
	return 0;
}

<img src="https://img-blog.youkuaiyun.com/20150527090633384?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvcGlwaTA5MDgwN2xpbGk=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />