链表——尾插法

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef struct student
{
    int num;
    float socre;
    struct student *next;
}Student;
Student *creatlist(void)
{
    Student *head,*pt;
    head=pt=(Student *)malloc(sizeof(Student));
    pt = head;
    head->next=NULL;
    Student *cur=(Student *)malloc(sizeof(Student));
    int num;float socre;
    scanf("%d,%f",&num,&socre);
    while(num)
    {
        cur=(Student *)malloc(sizeof(Student));
        cur->num=num;
        cur->socre=socre;

        pt->next  = cur;
        cur->next = NULL;
        pt=cur;

        scanf("%d,%f",&num,&socre);
    }
    return head;
}
int main()
{
    Student *head=creatlist();
    head=head->next;
    while(head)
    {

        printf("num:%d,socre:%.f\n",head->num,head->socre);
        head=head->next;
            
    }
    system("pause");
}