實(shí)驗(yàn)二-線性表鏈?zhǔn)酱鎯\(yùn)算的算法實(shí)現(xiàn)(昆工版)

昆明理工大學(xué)信息工程與自動化學(xué)院學(xué)生實(shí)驗(yàn)報告〔2023—2023學(xué)年第三學(xué)期〕課程名稱：數(shù)據(jù)結(jié)構(gòu)開課實(shí)驗(yàn)室：信自樓4442023年11月12日年級、專業(yè)、班計(jì)科122班學(xué)號202310405204姓名鄒華宇成績實(shí)驗(yàn)工程名稱線性表鏈?zhǔn)酱鎯\(yùn)算的算法實(shí)現(xiàn)指導(dǎo)教師胡守成教師評語教師簽名：年月日注：報告內(nèi)容按實(shí)驗(yàn)須知中七點(diǎn)要求進(jìn)行。主函數(shù)調(diào)用菜單函數(shù)調(diào)用創(chuàng)立函數(shù)主函數(shù)調(diào)用菜單函數(shù)調(diào)用創(chuàng)立函數(shù)調(diào)用插入函數(shù)調(diào)用刪除函數(shù)調(diào)用輸出函數(shù)程序結(jié)束1.掌握線性表鏈?zhǔn)酱鎯Y(jié)構(gòu)的C語言描述及運(yùn)算算法的實(shí)現(xiàn)；2.分析算法的空間復(fù)雜度和插入和刪除的時間復(fù)雜度；3.總結(jié)比擬線性表順序存儲存儲與鏈?zhǔn)酱鎯Φ母髯蕴攸c(diǎn)。程序功能：1.(菜單)主程序；2.鏈表的建立；3.鏈表的數(shù)據(jù)插入；4.鏈表的數(shù)據(jù)刪除；5.鏈表的數(shù)據(jù)輸出；二、實(shí)驗(yàn)原理及根本技術(shù)路線圖〔方框原理圖〕三、所用儀器、材料〔設(shè)備名稱、型號、規(guī)格等〕聯(lián)想計(jì)算機(jī)一臺MicrosoftVisualc++6.0四、程序源代碼#include<stdio.h>#include<conio.h>#include<malloc.h>#include<stdlib.h>typedefintdataType;typedefstructnode{dataTypedata;structnode*next;}linkList;linkList*createList(){intnum;linkList*head,*s,*r;head=NULL;r=NULL;printf("Enterthenumber(0tostop):");scanf("%d",&num);while(num!=00){s=(linkList*)malloc(sizeof(linkList));s->data=num;if(head==NULL)head=s;elser->next=s;r=s;printf("Enterthenumber(0tostop):");scanf("%d",&num);}if(r!=NULL)r->next=NULL;returnhead;}linkList*get(linkList*head,inti){intj;linkList*p;p=head;j=0;while((p->next!=NULL)&&(j<i)){p=p->next;j++;}if(i==j)returnp;elsereturnNULL;}linkList*locate(linkList*head,dataTypekey){linkList*p;p=head->next;while(p!=NULL){if(p->data!=key)p=p->next;elsebreak;}returnp;}voidinsertAfter(linkList*p,dataTypex){linkList*s;s=(linkList*)malloc(sizeof(linkList));s->data=x;s->next=p->next;p->next=s;}voidinsertBefore(linkList*p,dataTypex){linkList*s;s=(linkList*)malloc(sizeof(linkList));s->data=p->data;s->next=p->next;p->next=s;p->data=x;}voidinsert(linkList*L,dataTypex,inti){linkList*p;intj;j=i-1;p=get(L,j);if(p==NULL){printf("erro\n");getch();}else{insertAfter(p,x);printf("\nInsertSucceed");getch();}}voiddeleteAfter(linkList*p){linkList*r;r=p->next;p->next=r->next;free(r);}voidDelete(linkList*L,inti){intj;linkList*p;j=i-1;p=get(L,j);if(p!=NULL&&p->next!=NULL){deleteAfter(p);printf("\nDeleteSucceed");getch();}else{printf("error\n");getch();}}voiddisplay(linkList*head){inti=1;if(head==NULL){printf("EmptyList\n");}while(head!=NULL){printf("Index[%d]:%d\n",i,head->data);head=head->next;i++;}}charcaiDan(){charch;do{printf("1:CreateNewList\n");printf("2:Insert\n");printf("3:Delete\n");printf("4:Display\n");printf("5:Exit\n");printf("PleaseChoose:");}while(ch=getch(),ch!='1'&&ch!='2'&&ch!='3'&&ch!='4'&&ch!='5');returnch;}voidmain(){linkList*head=NULL;charch;inti,key;do{system("cls");ch=caiDan();printf("%c",ch);getch();printf("\n");switch(ch){case'1':head=createList();printf("Listwascreatedsuccessfully");getch();break;case'2':display(head);if(head==NULL){getch();break;}else{printf("\nInputKey:");scanf("%d",&key);printf("InputIndexuwanttoinsertafter:");scanf("%d",&i);insert(head,key,i);break;}case'3':display(head);if(head==NULL){getch();break;}else{printf("\nInputindexyouwanttodelete:");scanf("%d",&i);Delete(head,i-1);break;}case'4':display(head);getch();break;case'5':exit(0);}}while(ch!='5');