学生链表1

#include<stdio.h>
#include<stdlib.h>

#define NULL 0
#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=0;
 p1=p2=(struct student *)malloc(LEN);
 scanf("%ld,%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(LEN);
   scanf("%ld,%f",&p1->num,&p1->score);
   }
   p2->next=NULL;
   return(head);}

/*   out    */
void print(head)
struct student *head;
{struct student *p;
 printf("/n Now, these %d records are:/n",n);
 p=head;
 if(head!=NULL)
  do
  {printf("%ld %5.1f/n",p->num,p->score);
  p=p->next;
  }while (p!=NULL);
}

/*   del  */
struct student *del(head,num)
struct student *head;
long num;
{
struct student *p1,*p2;
if(head==NULL)
{printf("/nlist null!/n");
goto end;
}
p1=head;
while(num!=p1->num&&p1->next!=NULL)
{p2=p1;p1=p1->next;}
if(num==p1->num)
{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);
}

/*   insert  */
struct student *insert(head,stud)
struct student *head,*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);
}

main()
{
struct student *head,stu;
long del_num;
printf("input records:/n");
head=creat();
print(head);
printf("/ninput the deleted number:");
scanf("%ld",&del_num);
head=del(head,del_num);
print(head);
printf("/ninput the inserted record:");
scanf("%ld,%f",&stu.num,&stu.score);
head=insert(head,&stu);
print(head);
}

阅读更多
个人分类: C语言学习
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭