C链表

先上代码

#include<stdio.h>
#include<malloc.h>
#define  LEN sizeof(struct student)
struct student
{

    long num;
    float score;
    struct student *next;
};
int n;
//插入链表
struct student *creat()
{

    struct student *head;
    struct student *p1,*p2;
    n=NULL;
    p1=p2=(struct student*)malloc(sizeof(struct student));
    scanf("%ld,%f",&p1->num,&p1->score);
    head=NULL;
    while(p1->num!=NULL)
    {

        n=n+1;
        if(n==1)head=p1;
        else p2->next=p1;
        p2=p1;

        p1=(struct student*)malloc(sizeof(struct student));
    scanf("%ld,%f",&p1->num,&p1->score);
    }
    p2->next=NULL;
        return(head);
};
//输出链表
void print(struct student *head)
{

    struct student *p;
    printf("\nThe %d answers are \n",n);
    p=head;
    if(head!=NULL)
    do{
        printf("%ld %.5lf\n",p->num,p->score);
        p=p->next;
    }while(p!=NULL);
}
//删除链表
struct student *del(struct student *head,long num)
{

    struct student *p1,*p2;
    if(head==NULL)
    {
        printf("\n list null \n");
        goto end;
        p1=head;
        while(num!=p1->num&&p1->next!=NULL)
        {

            p2=p1;
            p1=p1->next;
        }

            if(num==p1->next)
            {

                if(p1==head)
                    head=p1->next;
                else p2->next=p1->next;
                printf("delete : %ld \n",num);
                n=n-1;
            }
            else printf("%ld not been found ! \n",num);
            end:
                return (head);
    }
};
//插入新结点
struct student *insert(struct student*head,struct student *stud)
{

    struct student *p0,*p1,*p2;
    p1=head;
    p0=stud;
    if(head==NULL)
    {

        head=p0;
        p0->next=NULL;
    }
    else {
        while((p0->num>p1->num)&&(p1->next!=NULL))
        {
            p2=p1;
            p1=p1->next;
        }//寻找位置
        if(p0->num<=p1->num)
        {

            if(head==p1)
                head=p0;//位置在链头
            else p2->next=p0;//位置在中间
            p0->next=p1;
        }
       else
       {

           p1->next=p0;
           p0->next=NULL;
       }
    }
    n=n+1;
    return(head);
};
int main()
{
    struct student *head,stu;
    long delnum;
    printf("input records : \n");
    head=creat();
    print(head);
    printf(" \n input the deleted number \n");
    scanf("%ld",&delnum);
    head=del(head,delnum);
    print(head);
    printf(" \n input the nem student : \n");
    scanf("%ld",&stu.num,&stu.score);
    head=insert(head,&stu);
    print(head);
    return NULL;

}

**

---

---

**

**

---

---

**
**

---

---

**
**

---

---

**
**

---

---

**
**

---

---

**
**

---

---

**




**

//插入链表
struct student *creat()
{

    struct student *head;
    struct student *p1,*p2;
    n=NULL;
    p1=p2=(struct student*)malloc(sizeof(struct student));
    scanf("%ld,%f",&p1->num,&p1->score);
    head=NULL;
    while(p1->num!=NULL)
    {

        n=n+1;
        if(n==1)head=p1;
        else p2->next=p1;
        p2=p1;

        p1=(struct student*)malloc(sizeof(struct student));
    scanf("%ld,%f",&p1->num,&p1->score);
    }
    p2->next=NULL;
        return(head);
};

---

---

**
**

---

---

**

**

//输出链表
void print(struct student *head)
{

    struct student *p;
    printf("\nThe %d answers are \n",n);
    p=head;
    if(head!=NULL)
    do{
        printf("%ld %.5lf\n",p->num,p->score);
        p=p->next;
    }while(p!=NULL);
}

---

---

**

**

//删除链表
struct student *del(struct student *head,long num)
{

    struct student *p1,*p2;
    if(head==NULL)
    {
        printf("\n list null \n");
        goto end;
        p1=head;
        while(num!=p1->num&&p1->next!=NULL)
        {

            p2=p1;
            p1=p1->next;
        }

            if(num==p1->next)
            {

                if(p1==head)
                    head=p1->next;
                else p2->next=p1->next;
                printf("delete : %ld \n",num);
                n=n-1;
            }
            else printf("%ld not been found ! \n",num);
            end:
                return (head);
    }
};

---

---

**

//插入新结点
struct student *insert(struct student*head,struct student *stud)
{

    struct student *p0,*p1,*p2;
    p1=head;
    p0=stud;
    if(head==NULL)
    {

        head=p0;
        p0->next=NULL;
    }
    else {
        while((p0->num>p1->num)&&(p1->next!=NULL))
        {
            p2=p1;
            p1=p1->next;
        }//寻找位置
        if(p0->num<=p1->num)
        {

            if(head==p1)
                head=p0;//位置在链头
            else p2->next=p0;//位置在中间
            p0->next=p1;
        }
       else
       {

           p1->next=p0;
           p0->next=NULL;
       }
    }
    n=n+1;
    return(head);
};