第十四周作业2

#include<iostream>

using namespace std;

class Student
{                          
public:
	Student(int n,double s){num = n; score = s; next = NULL;}
	Student *next;
	int num;
	double score;
};

class MyList
{
public:
	MyList(){head = NULL;}
	MyList(int n, double s){head = new Student(n, s);} //以Student(n,s)作为单结点的链表
	int display();  //输出链表，返回值为链表中的结点数
	void insert(int n, double s);  //插入：将Student(n,s)结点插入链表，该结点作为第一个结点
	void append(int n, double s);  //追加：将Student(n,s)结点插入链表，该结点作为最后一个结点
	void cat(MyList &il); //将链表il连接到当前对象的后面
	int length();  //返回链表中的结点数
private:
	Student *head;
};

int MyList::display() //输出链表，返回值为链表中的结点数
{
	Student *p;
	int n = 0;
	p = head;
	while(p != NULL)
	{
		cout << p-> num << " " << p->score << endl;   
		p = p->next;
		++n;
	}
	return n;
}

void MyList::insert(int n, double s)  //插入：将Student(n,s)结点插入链表，该结点作为第一个结点
{
	Student *p = head;
	head = new Student(n, s);
	head->next = p;
}

void MyList::append(int n, double s)  //追加：将Student(n,s)结点插入链表，该结点作为最后一个结点
{
	Student *p = head;
	while (p->next != NULL)
	{
		p = p->next;
	}
	p->next = new Student(n, s);
}

void MyList::cat(MyList &il) //将链表il连接到当前对象的后面
{
	Student *p = head;
	while (p->next != NULL)
	{
		p = p->next;
	}
	p->next = il.head;
}

int MyList::length()  //返回链表中的结点数
{
	int n = 0;
	Student *p = head;
	while (p->next != NULL)
	{
		p = p->next;
		++n;
	}
	return n;
}

int main()
{
	int n;
	double s;
	MyList head1;
	cout << "input head1: " << endl;  //输入head1链表
	for(int i = 0; i < 3; i++)
	{
		cin >> n >> s;
		head1.insert(n, s);  //通过“插入”的方式
	}
	cout << "head1: " << endl; //输出head1
	head1.display();

	MyList head2(1001, 98.4);  //建立head2链表
	head2.append(1002, 73.5);  //通过“追加”的方式增加结点
	head2.append(1003, 92.8);
	head2.append(1004, 99.7);
	cout << "head2: " << endl;   //输出head2
	head2.display();

	head2.cat(head1);   //反head1追加到head2后面
	cout << "length of head2 after cat: " << head2.length() << endl;
	cout << "head2 after cat: " << endl;   //显示追加后的结果
	head2.display();

	system("pause");
	return 0;
}

input head1:
e
head1:
-858993460 -9.25596e+061
-858993460 -9.25596e+061
-858993460 -9.25596e+061
head2:
1001 98.4
1002 73.5
1003 92.8
1004 99.7
length of head2 after cat: 6
head2 after cat:
1001 98.4
1002 73.5
1003 92.8
1004 99.7
-858993460 -9.25596e+061
-858993460 -9.25596e+061
-858993460 -9.25596e+061
请按任意键继续. . .

 

 

 

 上周网速不行。。没有按时提交。。特此补上