
展开全部
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define UNLL 0
struct student
{long num;
float score;
struct student *next;
};
int n; //n为全局变量
//定义建立链表函数.此函数带回一个指向链表头的指针
struct student *creat(void)
{struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=new student; //开辟一个新单元
printf("请输入学号,成绩(按0结束):\n");
scanf("%ld,%f",&p1->num,&p1->score);
head=NULL;
while(p1->num!=0)
{n+=1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=new student;
scanf("%ld,%f",&p1->num,&p1->score);
}
p2->next=NULL;
return(head);
}
//输出链表的函数
void print(struct student *head)
{struct student *p;
printf("Now this %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);
else printf("no record\n");
}
//链表删除结点函数
struct student *del(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)//p1指向不是所要找的结点,并且后面还有结点
{p2=p1;p1=p1->next;}//p1后移一个结点
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 is not find!",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);
}
//主函数
void main()
{
struct student *head,*stu;
long del_num;
printf("input records:\n");
head=creat(); //调用建立链表函数
print(head);
printf("\ninput the deleted number(按0结束):");
scanf("%ld",&del_num);
while(del_num!=0)
{head=del(head,del_num);
print(head);
printf("\ninput the deleted number:");
scanf("%ld",&del_num);
}
printf("\ninput the inserted record(按0结束):");
stu=new student;
scanf("%ld,%f",&stu->num,&stu->score);
while(stu->num!=0)
{head=insert(head,stu);
print(head);
printf("\ninput the inserted record:");
stu=new student;
scanf("%ld,%f",&stu->num,&stu->score);
}
}
#include<string.h>
#include<stdlib.h>
#define UNLL 0
struct student
{long num;
float score;
struct student *next;
};
int n; //n为全局变量
//定义建立链表函数.此函数带回一个指向链表头的指针
struct student *creat(void)
{struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=new student; //开辟一个新单元
printf("请输入学号,成绩(按0结束):\n");
scanf("%ld,%f",&p1->num,&p1->score);
head=NULL;
while(p1->num!=0)
{n+=1;
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=new student;
scanf("%ld,%f",&p1->num,&p1->score);
}
p2->next=NULL;
return(head);
}
//输出链表的函数
void print(struct student *head)
{struct student *p;
printf("Now this %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);
else printf("no record\n");
}
//链表删除结点函数
struct student *del(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)//p1指向不是所要找的结点,并且后面还有结点
{p2=p1;p1=p1->next;}//p1后移一个结点
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 is not find!",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);
}
//主函数
void main()
{
struct student *head,*stu;
long del_num;
printf("input records:\n");
head=creat(); //调用建立链表函数
print(head);
printf("\ninput the deleted number(按0结束):");
scanf("%ld",&del_num);
while(del_num!=0)
{head=del(head,del_num);
print(head);
printf("\ninput the deleted number:");
scanf("%ld",&del_num);
}
printf("\ninput the inserted record(按0结束):");
stu=new student;
scanf("%ld,%f",&stu->num,&stu->score);
while(stu->num!=0)
{head=insert(head,stu);
print(head);
printf("\ninput the inserted record:");
stu=new student;
scanf("%ld,%f",&stu->num,&stu->score);
}
}
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询