数据结构实验题答案.docx

1、数据结构实验题答案#include#include#define OK 1 #define ERROR 0#define LIST_INIT_SIZE 100#define LISTINCREMENT 10#define ElemType inttypedef struct int *elem; int length; int listsize;SqList;int InitList_Sq(SqList &L) L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType); if(!L.elem) return ERROR; L.length

2、=0; L.listsize=LIST_INIT_SIZE; return OK;/ 算法2.3，构造一个空的线性表L，该线性表预定义大小为LIST_INIT_SIZE/ 请补全代码int Load_Sq(SqList &L)/ 输出顺序表中的所有元素 int i; if(L.length=0) printf(The List is empty!); / 请填空 else printf(The List is: ); for(i=0;iL.length;i+) printf(%d ,L.elemi); / 请填空 printf(n); return OK;int ListInsert_Sq(S

3、qList &L,int i,int e) int *newbase,*p,*q; if(iL.length+1) return ERROR; if(L.length=L.listsize) newbase=(ElemType*)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType); if(!newbase) return ERROR; L.elem=newbase; L.listsize+=LISTINCREMENT; q=&(L.elemi-1); for(p=&L.elemL.length-1;p=q;-p) *(p+1)=

4、*p; *q=e; +L.length; return OK;/ 算法2.4，在顺序线性表L中第i个位置之前插入新的元素e/ i的合法值为1iL.length +1/ 请补全代码int ListDelete_Sq(SqList &L,int i, int &e) int *p,*q; if(iL.length) return ERROR; p=&(L.elemi-1); e=*p; q=L.elem+L.length-1; for(+p;p=q;+p) *(p-1)=*p; -L.length; return OK;/ 算法2.5,在顺序线性表L中删除第i个位置的元素，并用e返回其值/ i的合

5、法值为1iL.length/ 请补全代码int main() SqList T; int a, i; ElemType e, x; if(InitList_Sq(T) / 判断顺序表是否创建成功 printf(A Sequence List Has Created.n); while(1) printf(1:Insert elementn2:Delete elementn3:Load all elementsn0:ExitnPlease choose:n); scanf(%d,&a); switch(a) case 1: scanf(%d %d,&i,&x); if(!ListInsert_S

6、q(T,i,x) printf(Insert Error!n); / 判断i值是否合法，请填空 else printf(The Element %d is Successfully Inserted!n, x); break; case 2: scanf(%d,&i); if(!ListDelete_Sq(T,i,e) printf(Delete Error!n); / 判断i值是否合法，请填空 else printf(The Element %d is Successfully Deleted!n, e); break; case 3: Load_Sq(T); break; case 0:

7、return 1; #include#include#define OK 1#define ERROR 0#define LIST_INIT_SIZE 100#define LISTINCREMENT 10#define ElemType inttypedef struct int *elem; int length; int listsize;List;int InitList(List &L) L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType); if(!L.elem) return ERROR; L.length=0; L.l

8、istsize=LIST_INIT_SIZE; return OK;int Load(List &L) int i; if(L.length=0) printf(The List is empty!); elsefor(i=0;iL.length;i+) printf(%d ,L.elemi); printf(n); return OK;int MergeList(List La,List Lb,List &Lc) int *pa,*pb,*pc; int *pa_last,*pb_last; pa=La.elem; pb=Lb.elem; Lc.listsize=Lc.length=La.l

9、ength+Lb.length; pc=Lc.elem=(ElemType*)malloc(Lc.listsize*sizeof(ElemType); if(!Lc.elem) return ERROR; pa_last=La.elem+La.length-1; pb_last=Lb.elem+Lb.length-1; while(pa=pa_last)&(pb=pb_last) if(*pa=*pb) *pc+=*pa+; else *pc+=*pb+; while(pa=pa_last)*pc+=*pa+; while(pb=pb_last)*pc+=*pb+; return OK;voi

10、d main() List La,Lb,Lc; InitList(La); InitList(Lb); int i,j; scanf(%d,&La.length); for(i=0;iLa.length;i+) scanf(%d,&La.elemi); scanf(%d,&Lb.length); for(j=0;jLb.length;j+) scanf(%d,&Lb.elemj); MergeList(La,Lb,Lc); printf(List A:); Load(La); printf(List B:); Load(Lb); printf(List C:); Load(Lc);#inclu

11、de#include#define OK 1#define ERROR 0#define LIST_INIT_SIZE 100#define LISTINCREMENT 10#define ElemType inttypedef struct int *elem; int length; int listsize;List;int InitList(List &L) L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType); if(!L.elem) return ERROR; L.length=0; L.listsize=LIST_INI

12、T_SIZE; return OK;int Load(List &L) int i; if(L.length=0) printf(The List is empty!); elsefor(i=0;iL.length;i+) printf(%d ,L.elemi); printf(n); return OK;int MergeList(List La,List &Lc) int *pa,*pc,i,a; int *pa_last; pa=La.elem; Lc.listsize=Lc.length=La.length; pc=Lc.elem=(ElemType*)malloc(Lc.listsi

13、ze*sizeof(ElemType); if(!Lc.elem) return ERROR; pa_last=La.elem+La.length-1; for(i=0;iLa.length/2;i+) a=paLa.length-i-1; paLa.length-i-1=pai; pai=a; while(pa=pa_last) *pc+=*pa+; return OK;void main() List La,Lc; InitList(La); int i,j; scanf(%d,&La.length); for(i=0;iLa.length;i+) scanf(%d,&La.elemi);

14、 printf(The List is:); Load(La); MergeList(La,Lc); printf(The turned List is:); Load(Lc);#include#include#define ERROR 0#define OK 1 #define ElemType inttypedef struct LNode int data; struct LNode *next;LNode,*LinkList;int CreateLink_L(LinkList &L,int n)/ 创建含有n个元素的单链表 LinkList p,q; int i; ElemType e

15、; L = (LinkList)malloc(sizeof(LNode); L-next = NULL; / 先建立一个带头结点的单链表 q = (LinkList)malloc(sizeof(LNode); q = L; for (i=0; idata=e;/ 请补全代码 q-next=p; q=p; q-next=NULL; return OK;int LoadLink_L(LinkList &L)/ 单链表遍历 LinkList p = L-next; if(!p)printf(The List is empty!); / 请填空 else printf(The LinkList is:

16、); while(p) / 请填空 printf(%d ,p-data); p=p-next; / 请填空 printf(n); return OK;int LinkInsert_L(LinkList &L,int i,ElemType e) int j; LNode *p,*s; p=L;j=0; while(p&jnext;+j; if(!p|ji-1) return ERROR; s=(LinkList)malloc(sizeof(LNode); s-data=e; s-next=p-next; p-next=s; return OK;/ 算法2.9/ 在带头结点的单链线性表L中第i个位

17、置之前插入元素e/ 请补全代码int LinkDelete_L(LinkList &L,int i, ElemType &e) LNode *p,*q; int j; p=L;j=0; while(p-next&jnext;+j; if(!(p-next) | ji-1) return ERROR; q=p-next; p-next=q-next; e=q-data; free(q); return OK;/ 算法2.10/ 在带头结点的单链线性表L中，删除第i个元素，并用e返回其值/ 请补全代码int main() LinkList T; int a,n,i; ElemType x, e;

18、printf(Please input the init size of the linklist:n); scanf(%d,&n); printf(Please input the %d element of the linklist:n, n); if(CreateLink_L(T,n) / 判断链表是否创建成功，请填空 printf(A Link List Has Created.n); LoadLink_L(T); while(1) printf(1:Insert elementn2:Delete elementn3:Load all elementsn0:ExitnPlease ch

19、oose:n); scanf(%d,&a); switch(a) case 1: scanf(%d%d,&i,&x); if(!LinkInsert_L(T,i,x) printf(Insert Error!n); / 判断i值是否合法，请填空 else printf(The Element %d is Successfully Inserted!n, x); break; case 2: scanf(%d,&i); if(!LinkDelete_L(T,i,e) printf(Delete Error!n); / 判断i值是否合法，请填空 else printf(The Element %d

20、 is Successfully Deleted!n, e); break; case 3: LoadLink_L(T); break; case 0: return 1; #include#include#define ERROR 0#define OK 1 #define ElemType inttypedef struct LNode int data; struct LNode *next;LNode,*LinkList;int CreateLink_L(LinkList &L,int n)/ 创建含有n个元素的单链表 LinkList p,q; int i; ElemType e;

21、L = (LinkList)malloc(sizeof(LNode); L-next = NULL; / 先建立一个带头结点的单链表 q = (LinkList)malloc(sizeof(LNode); q = L; for (i=0; idata=e;/ 请补全代码 q-next=p; q=p; q-next=NULL; return OK;int LoadLink_L(LinkList &L)/ 单链表遍历 LinkList p = L-next; if(!p)printf(The List is empty!); / 请填空 else while(p) / 请填空 printf(%d

22、,p-data); p=p-next; / 请填空 printf(n); return OK;int MergeList_L(LinkList &La,LinkList &Lb,LinkList &Lc) LNode *pa,*pb,*pc; pa=La-next; pb=Lb-next; Lc=pc=La; while(pa&pb) if(pa-datadata) pc-next=pa;pc=pa;pa=pa-next; else pc-next=pb;pc=pb;pb=pb-next; pc-next=pa?pa:pb; free(Lb); return OK;void main() Li

23、nkList La,Lb,Lc; int n,m; scanf(%d,&n); CreateLink_L(La,n); scanf(%d,&m); CreateLink_L(Lb,m); printf(List A:); LoadLink_L(La); printf(List B:); LoadLink_L(Lb); MergeList_L(La,Lb,Lc); printf(List C:); LoadLink_L(Lc);#include#include#define ERROR 0#define OK 1 #define ElemType inttypedef struct LNode

24、int data; struct LNode *next;LNode,*LinkList;int CreateLink_L(LinkList &L,int n)/ 创建含有n个元素的单链表 LinkList p,q; int i; ElemType e; L = (LinkList)malloc(sizeof(LNode); L-next = NULL; / 先建立一个带头结点的单链表 q = (LinkList)malloc(sizeof(LNode); q = L; for (i=0; idata=e;/ 请补全代码 q-next=p; q=p; q-next=NULL; return O

25、K;int LoadLink_L(LinkList &L)/ 单链表遍历 LinkList p = L-next; if(!p)printf(The List is empty!); / 请填空 else while(p) / 请填空 printf(%d ,p-data); p=p-next; / 请填空 printf(n); return OK;int Change_L(LinkList &La,LinkList &Lc) LNode *p,*q,*b; p=La-next; Lc=(LinkList)malloc(sizeof(LNode);Lc=b=La; b-next = NULL;

26、while(p) q=p; p=p-next; q-next=b-next; b-next=q; return OK;void main() LinkList La,Lc; int n; scanf(%d,&n); CreateLink_L(La,n); printf(The List is:); LoadLink_L(La); Change_L(La,Lc); printf(The turned List is:); LoadLink_L(Lc);#include #include #define OK 1#define ERROR 0#define STACK_INIT_SIZE 100 / 存储空间初始分配量#define STACKINCREMENT 10 / 存储空间分配增量typedef int SElemType; / 定义栈元素类型typedef int Status; / Status是函数的类型,其值是函数结果状态代码，如OK等struct SqStack SElemType *base; / 在栈构造之前和销毁之后，base的值为NULL SElemType *top; / 栈顶