c语言练习8

8、链表的建立、输出及删除、插入结点。

程序：

#include<stdio.h>
#include<malloc.h>

#define NULL 0
#define LEN sizeof(struct STU)
struct STU
{
       int num;
       float score;
       struct STU *next;
};
int n;        /*全局变量*/
struct STU *creat(void)
{
       struct STU *head,*p1,*p2;
       p1=p2=(struct STU *)malloc(LEN);
       scanf("%d,%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 STU *)malloc(LEN);
           scanf("%d,%f",&p1->num,&p1->score);               
       }
       p2->next=NULL;
       return(head);
}
void print(struct STU *head)
{
     struct STU *p;
     printf("/nthese %d records are:/n",n);
     p=head;
     if(head!=NULL)
     do{
          printf("%-4d%5.1f/n",p->num,p->score);
          p=p->next;       
     }while(p!=NULL);
}
struct STU *del(struct STU *head,int num)
{
     struct STU *p1,*p2;
     if(head==NULL)
     {
         printf("/nlist null!/n");
         return head;         
     }
     p1=head;
     while(p1->num!=num&&p1->next!=NULL)
     {
         p2=p1;
         p1=p1->next;          
     }
     if(p1->num==num)
     {
         if(p1==head)head=p1->next;
         else p2->next=p1->next;
         printf("delete:%d/n",num);
         n=n-1;           
     }
     else printf("%d not been found!/n",num);
     return (head);    
}
struct STU *insert(struct STU *head,struct STU *stud)
{
       struct STU *p1,*p2,*p0;
       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);
       }
}
void main()
{
     struct STU *head,*stu;
     int del_num;
     printf("input records:/n");
     head=creat();
     print(head);
     printf("/ninput the deleted number:");
     scanf("%d",&del_num);
     while(del_num!=0)
     {
         head=del(head,del_num);
         print(head);
         printf("input the deleted number:");
         scanf("%d",&del_num);           
     }
     printf("/ninput the insert records:");
     stu=(struct STU *)malloc(LEN);
     scanf("%d,%f",&stu->num,&stu->score);
     while(stu->num!=0)
     {
         head=insert(head,stu);
         print(head);
         printf("input the insert records:");
         stu=(struct STU *)malloc(LEN);
         scanf("%d,%f",&stu->num,&stu->score);           
     }
}