广中医数据结构实验二.doc

《广中医数据结构实验二.doc》由会员分享，可在线阅读，更多相关《广中医数据结构实验二.doc（12页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、广州中医药大学医学信息学院实 验 报 告课程名称：数据结构与算法专业班级：计算机科学与技术2014级学生学号： 学生姓名： 实验名称：实验成绩：课程类别：必修 限选 公选 其它实验二 单链表的操作（必做）实验目的掌握线性表链式存储的基本操作，能根据实际问题选择存储结构。实验内容（1）单链表的初始化操作（2）单链表的插入（3）单链表的输出（4）将2个有序的单链表合并为一个有序的单链表实验要求 程序用c语言实现，并调试通过。本次下课之前提交到教师机，迟交或不交的或源代码雷同者一律不做作业登记评分。作业提交 将代码贴在下面：LinkedList.h#include stdio.h#include s

2、tdlib.h#include malloc.htypedef int ElemType;typedef struct NodeElemType data;struct Node *next;LinkedList, *Link;void Intialize(LinkedList * *head);int Insert(LinkedList *head,int i,ElemType x);int Get(LinkedList *head,int i,ElemType *x);int Length(LinkedList *head);void Destroy(LinkedList * *head)

3、;void Combine(Link list1, Link list2);LinkedList.cpp#include stdio.h#include stdlib.h#include malloc.h#include LinkedList.hvoid Intialize(LinkedList * *head)if(*head=(LinkedList *)malloc(sizeof(LinkedList)=NULL)exit(1);(*head)-next=NULL;int Insert(LinkedList *head,int i,ElemType x)LinkedList *p,*q;i

4、nt j;p=head;j=-1;while(p-next!=NULL&jnext;j+;if(j!=i-1)printf(插入位置参数错误);return 0;if(q=(LinkedList *)malloc(sizeof(LinkedList)=NULL)exit(1);q-data=x;q-next=p-next;p-next=q;return 1;int Get(LinkedList *head,int i,ElemType *x)LinkedList *p;int j;p=head;j=-1;while(p-next!=NULL&jnext;j+;if(j!=i)printf(取元

5、素位置参数出错!);return 0;*x=p-data;return 1;int Length(LinkedList *head)LinkedList *p=head;int size=0;while(p-next!=NULL)p=p-next;size+;return size;void Destroy(LinkedList * *head)LinkedList *p, *p1;p=*head;while(p!=NULL)p1=p;p=p-next;free(p1);*head=NULL;void Combine(Link list1, Link list2) LinkedList *p,

6、 *q, *r, *last; p=list1-next; q=list2-next; last=list1; last-next=NULL; while(p&q) if(p-data data) r=p; p=p-next; else r=q; q=q-next; r-next=last-next; last-next=r; last=r; if(p) last-next = p; else last-next = q; list2-next=NULL; Cpp2.cpp#include stdio.h#include stdlib.h#include malloc.htypedef int

7、 ElemType;#include LinkedList.hint main()LinkedList *head,*head1,*head2;int i,n,x; for(n=0;n2;n+) x=n-2;Intialize(&head);for(i=0;i10;i+)Insert(head,i,x=x+2);printf(链表%d为:n,n+1);for(i=0;iLength(head);i+)Get(head,i,&x);printf(%d ,x);printf(n);if(n=0) head1=head;if(n=1) head2=head;Combine(head1,head2);

8、printf(合并后的链表为：n);for(i=0;inext=NULL;int Insert(polynome *head,int i,ElemType x)polynome *p,*q;int j;p=head;j=-1;while(p-next!=NULL)&(jnext;j+;if(j!=i-1)printf(插入位置参数错误);return 0;if(q=(polynome *)malloc(sizeof(polynome)=NULL)exit(1);q-data=x;q-next=p-next;p-next=q;return 1;int Get(polynome *head,int

9、 i,ElemType *x)polynome *p;int j;p=head;j=-1;while(p-next!=NULL&jnext;j+;if(j!=i)printf(取元素位置参数出错!);return 0;*x=p-data;return 1;int Length(polynome *head)polynome *p=head;int size=0;while(p-next!=NULL)p=p-next;size+;return size;void Destroy(polynome * *head)polynome *p, *p1;p=*head;while(p!=NULL)p1=

10、p;p=p-next;free(p1);*head=NULL;void Combine(poly list1, poly list2) polynome *p, *q; p=list1-next; q=list2-next; while(p&q) p-data=p-data+q-data;p=p-next;q=q-next; if(q) p=q; list2-next=NULL; Cpp2.cpp#include stdio.h#include stdlib.h#include malloc.htypedef int ElemType;#include polynome.hint main()

11、polynome *head,*head110;int i,n,x,x1,number,times,t1,t2;printf(请输入一元多项式的个数：);scanf(%d,&number); for(n=0;nnumber;n+) Intialize(&head);printf(输入第%d个多项式：n,n+1);printf(最高次项的次数为：);scanf(%d,×);for(i=0;i=times;i+)printf(输入%d次方的系数：,i);scanf(%d,&x);Insert(head,i,x);printf(第%d个多项式为:n,n+1);printf(-n);for(

12、i=0;iLength(head);i+) Get(head,i,&x);if(x=0) continue;if(i=0) printf(%d,x);else if(i=Length(head)-1)Get(head,Length(head)-2,&x1); if(x!=0&x1!=0)printf(+);printf(%dx%d,x,i);if(iLength(head)-2)printf(+);printf(n-n);head1n=head;printf(输入相加的两个多项式的序号：);scanf(%d%*c%d,&t1,&t2);Combine(head1t1-1,head1t2-1);

13、printf(合并后的多项式为：n);printf(-n);for(i=0;iLength(head1t1-1);i+) Get(head1t1-1,i,&x);if(x=0) continue;if(i=0) printf(%d,x);else if(i=Length(head1t1-1)-1) if(Get(head1t1-1,Length(head1t1-1)-1,&x)!=0)printf(+);printf(%dx%d,x,i);if(iLength(head1t1-1)-2)printf(+);printf(n-n);Destroy(&head);Destroy(head1);return 0;运行结果：