动态建立链表和输出链表

#include <stdio.h>
#include <stdlib.h>
#define LEN sizeof(struct Student)
struct Student
{
	long num;
	float score;
	struct Student *next;
};
int n;
struct Student *creat(void)//建立链表的函数，返回的是地址 
{
	struct Student *head,*p1,*p2;
	n=0;
	p1=p2=(struct Student *)malloc(LEN);
	scanf("%ld,%f",&p1->num,&p1->score);
	head =NULL;
	while(p1->num!=0)
	{
		n=n+1;
		if(n==1)head=p1;
		p2->next=p1;
		p2=p1;
		p1= (struct Student *)malloc(LEN);
		scanf("%ld,%f",&p1->num,&p1->score);		
	}
	p2->next=NULL;
	return (head);//返回第一个节点的地址 
}
void print(struct Student *head)
{
	struct Student *p;
	printf("\nNOW,These %d records are:\n",n);
	p=head;
	if(head!=NULL)
	{
		do{
			printf("\%ld %5.1f\n",p->num,p->score);
			p=p->next;
			
		}while (p!=NULL);
	}
}
int main(void)
{
	struct Student *head;
	head=creat();
	print(head);
	return 0;
	
}