C语言第一个学期的链表

链表入门

打印链表
void print(struct student *head)//打印链表
{
    struct student *p;
    p=head;
    if(head!=NULL)
        do
    {
        printf("%d %.4f\n",p->num,p->score);
        p=p->next;
    }while(p!=NULL);
}

//创建链表

struct student *creat()//创建链表
{
    struct student *head,*p1,*p2;
    n=0;
    p1=p2=(struct student*)malloc(N);//特别注意struct student后面的*
    scanf("%d %f",&p1->num,&p1->score);
    head=NULL;
    while(p1->num!=0)
    {
        n=n+1;
        if(n==1) head=p1;
        else p2->next=p1;
        p2=p1;
        p1=(struct student *)malloc(N);
        scanf("%d %f",&p1->num,&p1->score);
    }
    p2->next=NULL;
    return (head);
}

且看完整代码

#include<stdio.h>
#include<stdlib.h>
#define N sizeof(struct student)
struct student
{
    int num;
    float score;
    struct student *next;//定义结构体指针
};
int n;
struct student *creat()//创建链表
{
    struct student *head,*p1,*p2;
    n=0;
    p1=p2=(struct student*)malloc(N);//特别注意struct student后面的*
    scanf("%d %f",&p1->num,&p1->score);
    head=NULL;
    while(p1->num!=0)
    {
        n=n+1;
        if(n==1) head=p1;
        else p2->next=p1;
        p2=p1;
        p1=(struct student *)malloc(N);
        scanf("%d %f",&p1->num,&p1->score);
    }
    p2->next=NULL;
    return (head);
}
void print(struct student *head)//打印链表
{
    struct student *p;
    p=head;
    if(head!=NULL)
        do
    {
        printf("%d %.4f\n",p->num,p->score);
        p=p->next;
    }while(p!=NULL);
}
int main()
{
    struct student *head;
    head=creat();
    print(head);
    return 0;
}

```![在这里插入图片描述](https://img-blog.csdnimg.cn/2020053121343885.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ4MjIzMTc5,size_16,color_FFFFFF,t_70#pic_center)