6379:统计学生信息（使用动态链表完成）

#老师写的：两个struct分的很清晰
#include<iostream>
#include<list>
using namespace std;

struct L{
	string number;
	string name;
	char sex;
	int age;
	float score;
	string address;
};
struct Node{
	L data;
	Node*next;
};


int main()
{
	//list <L> a;
	L b;
	Node * first=NULL, *p;
	while(true)
	{
		cin>>b.number;
		if(b.number=="end")
			break;
		cin>>b.name>>b.sex>>b.age>>b.score>>b.address;
		p=new Node;
		p->data=b;
		p->next=first;
		first=p; 
	}
	p=first;
	while (p)
	{
		cout<<p->data.number<<" "<<p->data.name<<" "<<p->data.sex<<" "<<p->data.age<<" "<<p->data.score<<" "<<p->data.address<<"\n";
		p=p->next;
	}
		
	return 0;
}

#额超内存看了老师写的，就换思路用一个来解决……
#include<i