線性表的順序及鏈?zhǔn)綄崿F(xiàn) 數(shù)據(jù)結(jié)構(gòu)實驗報告

實驗報告課程名稱：數(shù)據(jù)結(jié)構(gòu)實驗題目：線性表的順序及鏈?zhǔn)綄崿F(xiàn)一實驗?zāi)康睦斫庹莆站€性表的順序和鏈?zhǔn)浇Y(jié)構(gòu)，上機實現(xiàn)線性表的順序和鏈?zhǔn)浇Y(jié)構(gòu)的增、刪、查功能。二實驗內(nèi)容分別使用線性表的順序和鏈?zhǔn)酱鎯Y(jié)構(gòu)，編程實現(xiàn)線性表的增、刪、查等功能。三源程序#include<stdio.h>#include<stdlib.h>#defineOK1#defineERROR0#defineTRUE1#defineFALSE0#defineINFEASIBLE-1#defineOVERFLOW-2#defineLIST_INIT_SIZE100#defineLISTINCREMENT50typedefintStatus;typedefstruct{ int*elem; intlength; intlistsize;}SqList;StatusInitList_Sq(SqList&L){ L.elem=(int*)malloc(LIST_INIT_SIZE*sizeof(int)); if(!L.elem)exit(OVERFLOW); L.length=0; L.listsize=LIST_INIT_SIZE; returnOK;}StatusListInsert_Sq(SqList&L,inti,inte){ int*newbase; int*q; int*p; if(i<1||i>L.length+1)returnERROR; if(L.length>=L.listsize) { newbase=(int*)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(int)); if(!newbase)exit(OVERFLOW); L.elem=newbase; L.listsize+=LISTINCREMENT; } q=&(L.elem[i-1]); for(p=&(L.elem[L.length-1]);p>=q;--p)*(p+1)=*p; *q=e; ++L.length; returnOK;}StatusListDelete_Sq(SqList&L,inti,int&e){ int*q,*p; if((i<1)||(i>L.length))returnERROR; p=&(L.elem[i-1]); e=*p; q=L.elem+L.length-1; for(++p;p<=q;++p)*(p-1)=*p; --L.length; returnOK;}intLocateElem_Sq(SqListL,inte){ inti=1,*p; p=L.elem; while(i<=L.length&&*p++!=e)++i; if(i<=L.length)returni; elsereturn0;}voidmain(){SqListlist;inta,b,c;inti;InitList_Sq(list);boolflag=1;intcommend;printf("選擇操作內(nèi)容\n1：添加2：查找3：刪除4：退出\n");while(flag){scanf("%d",&commend);switch(commend){case1: { printf("請輸入添加位置\n");scanf("%d",&a); printf("請輸入數(shù)\n"); scanf("%d",&b); ListInsert_Sq(list,a,b); printf("添加成功\n"); for(i=0;i<list.length;i++) printf("%d",list.elem[i]);printf("\n請輸入操作1：添加2：查找3：刪除4：退出\n"); break; } case2:{ printf("請輸入查找的數(shù)\n"); scanf("%d",&a); c=LocateElem_Sq(list,a);printf("這個數(shù)在第%d個位置。",c);printf("\n請輸入操作1：插入2：查找3：刪除4：退出\n"); break; } case3:{ printf("請輸入位置\n"); scanf("%d",&a); ListDelete_Sq(list,a,b); printf("刪除成功\n"); for(i=0;i<list.length;i++) printf("%d",list.elem[i]);printf("\n請輸入操作1：添加2：查找3：刪除4：退出\n"); break; }case4:{flag=0;break; }default:{printf("輸入錯誤請重新輸入\n");break;}}}}#include<stdio.h>#include<stdlib.h>#defineTRUE1#defineFALSE0#defineOK1#defineERROR0typedefintStatus;typedefstructLNode{ intdata; structLNode*next;}LNode,*LinkList;StatusGetElem_L(LinkListL,inti,int&e){ structLNode*p;intj; p=L->next;j=1; while(p&&j<i) { p=p->next;++j; } if(!p||j>i)returnERROR; e=p->data; returnOK;}StatusListInsert_L(LinkList&L,inti,inte){ structLNode*p;structLNode*s; intj; p=L;j=0; while(p&&j<i-1){p=p->next;++j;} if(!p||j>i-1)returnERROR; s=(LinkList)malloc(sizeof(LNode)); s->data=e;s->next=p->next; p->next=s; returnOK;}StatusListDelete_L(LinkList&L,inti,int&e){structLNode*p;structLNode*q;intj; p=L;j=0; while(p->next&&j<i-1) { p=p->next; ++j; } if(!(p->next)||j>i-1)returnERROR; q=p->next;p->next=q->next; e=q->data;free(q); returne;}voidCreateList_L(LinkList&L,intn){ inti;structLNode*p; L=(LinkList)malloc(sizeof(LNode)); L->next=NULL; for(i=n;i>0;--i){ p=(LinkList)malloc(sizeof(LNode)); scanf("%d",&p->data); p->next=L->next; L->next=p; }}voidmain(){LNode*list;inta,b,c;inti;intj=1;structLNode*p;printf("輸入8個數(shù)\n");CreateList_L(list,8);boolflag=1;intcommend;printf("請輸入操作1：添加2：查找3：刪除4：退出\n");while(flag){scanf("%d",&commend);switch(commend){case1: {printf("輸入添加位置\n");scanf("%d",&a); printf("請輸入數(shù)\n"); scanf("%d",&b); ListInsert_L(list,a,b); printf("插入%d成功\n",b); for(p=list->next;p!=NULL;p=p->next) printf("%d",p->data); printf("\n請輸入操作1：添加2：查找3：刪除4：退出\n"); break; } case2:{printf("輸入查找第幾個數(shù)\n"); scanf("%d",&a); GetElem_L(list,a,b); printf("這個數(shù)%d\n",b);printf("請輸入操作1：添加2：查找3：刪除4：退出\n"); break; } case3:{printf("請輸入位置\n"); scanf("%d",&a); b=ListDelete_L(list,a,b); printf("刪除%d成功\n",b);for(p=list->next;p!=NULL;p=p->next) printf("%d",p->data); print