重新开始数据结构第二天：链表函数实现（1）

马上下课，稍后补充说明
代码内存不安全。

/*******************************************
        链表函数实现：List_Init
				  				List_Print
*******************************************/		


#include <iostream>
#include <cstdlib>
#include <string>
using namespace std;

struct node
{
	int score;
	string name;
	node *next = NULL;
}; 

node *List_Init(int n)
{
	node *p, *pr, *head;
	while(n--)
	{
		p = (node *)malloc(sizeof(node));
		int score_;
		string name_;
		cout<<"请输入该组简称与数据，中间以空格分开";
		cin>>name_>>score_;
		p->name = name_;
		p->score = score_;
		if(head == NULL)
			head = p;
		else 
			pr->next = p;
		pr = p;	
		free(p); 
		
	}
	
	return head;
	  
}

void List_Print(node *head)
{
	node *p;
	cout<<"结果如下";
	while(p->next != NULL)
	{
		cout<<p->name<<" "<<p->score<<" ";
		p = p->next;
	}
}

int main()
{
	node *head;
	int n;
	cout<<"请输入元素数";
	cin>>n;
	head = List_Init(n);
	List_Print(head);
	
	return 0;

	
}