链表建立，插入，删除，输出

本文主要是介绍链表建立，插入，删除，输出，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

自己的弱项 = =要好研究一下链表的问题= =

Description

Input

Output

Sample Input

Sample Output

#include <iostream>
#include <iomanip>
#define NULL 0
using namespace std;
struct student
{int num;float score;student *next;
};
int n;
student *creatlink(void)
{student *head;student *a,*b;n=0;a=b=new student;cin>>a->num>>a->score;head=NULL;while(a->num!=0&&a->score!=0){n=n+1;if(n==1)head=a;elseb->next=a;b=a;a=new student;cin>>a->num>>a->score;}b->next=NULL;return head;
}
student *dellink(student *head,long num)
{student *a,*b;if(head==NULL)return(head);a=head;while(num!=a->num&&a->next!=NULL){b=a;a=a->next;}if(num==a->num){if(a==head)head=a->next;elseb->next=a->next;n=n-1;}return head;
}student *insertlink(student *head,student *stud)
{student *a0,*a,*b;a=head;a0=new student;*a0=*stud;if(head==NULL){head=a0;a0->next=NULL;}else{while((a0->num>a->num)&&(a->next!=NULL)){b=a;a=a->next;}if(a0->num<=a->num){if(head==a)head=a0;elseb->next=a0;a0->next=a;}else{a->next=a0;a0->next=NULL;}}n=n+1;return head;
}
void printlink(student *head)
{student *a;a=head;if(head!=NULL)do{cout<<a->num<<" "<<a->score<<endl;a=a->next;}while(a!=NULL);
}
void freelink(student *head)
{delete head;
}
int main()
{student *creatlink(void);student *dellink(student *,long);student *insertlink(student *,student *);void printlink(student *);void freelink(student *);student *head,stu;long del_num;head=creatlink();cin>>del_num;head=dellink(head,del_num);cin>>stu.num>>stu.score;head=insertlink(head,&stu);cin>>stu.num>>stu.score;head=insertlink(head,&stu);cout<<setiosflags(ios::fixed);cout<<setprecision(2);printlink(head);freelink(head);return 0;
}

这篇关于链表建立，插入，删除，输出的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---