构建动态链表

#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;
 struct Student * p1;
 struct Student * p2;
 n=0;
 p1=p2=(struct Student *) malloc(LEN);//开辟新单元
 scanf("%ld,%f",&p1->num,&p1->score);//输入第一个学生的成绩和学号
 head = NULL;
 while(p1->num!=0)//当num等于0时结束输入
 {
  n=n+1;
  if(n==1)
  {
   head=p1;
  }
  else
  {
   p2->next=p1;
   p2=p1;
   p1=(struct Student *)malloc(LEN);
   scanf("%ld,%f",&p1->num,&p1->score);//输入后面学生的成绩和学号
  }
 }
 p2->next=NULL;
 return head;

}

main()
{
 struct Student * stu;
 stu = creat();
 printf("%ld,%.2f",stu->num,stu->score);
 return 0;
}