電子科技大學(xué)軟件技術(shù)基礎(chǔ)實(shí)驗(yàn)報(bào)告2

1、電子科技大學(xué) 通信與信息工程 學(xué)院標(biāo) 準(zhǔn) 實(shí) 驗(yàn) 報(bào) 告（實(shí)驗(yàn)）課程名稱 軟件技術(shù)基礎(chǔ)實(shí)驗(yàn) 電子科技大學(xué)教務(wù)處制表電 子 科 技 大 學(xué)實(shí) 驗(yàn) 報(bào) 告一、實(shí)驗(yàn)室名稱： 校公共機(jī)房 二、實(shí)驗(yàn)項(xiàng)目名稱：鏈表程序設(shè)計(jì)三、實(shí)驗(yàn)學(xué)時(shí)：4學(xué)時(shí)四、實(shí)驗(yàn)原理：使用VS2010等C語(yǔ)言集成開發(fā)環(huán)境（IDE），在微型計(jì)算機(jī)上對(duì)程序進(jìn)行編輯、編譯、連接與運(yùn)行。通過(guò)上機(jī)練習(xí)掌握在鏈表的建立、插入刪除等方法和過(guò)程。五、實(shí)驗(yàn)?zāi)康模?. 熟練鏈表的概念和基本操作方法。2. 掌握課程平臺(tái)使用方法。六、實(shí)驗(yàn)內(nèi)容：上機(jī)完成鏈表的一系列操作，并用鏈表完成課后習(xí)題9，編程實(shí)驗(yàn)，調(diào)試運(yùn)行程序并完成報(bào)告。七、實(shí)驗(yàn)器材（設(shè)備、元器件）：硬

2、件要求：普通pc機(jī)，1G內(nèi)存，100G硬盤空間即可。 軟件要求：Windows 7，包括C編譯器的IDE。八、實(shí)驗(yàn)步驟、實(shí)驗(yàn)編程與運(yùn)行結(jié)果：1. 程序文件名為*.cpp，源程序清單如下：/*基礎(chǔ)實(shí)驗(yàn)1，鏈表的建立，插入，刪除*/#include<stdio.h> #include<stdlib.h>struct listint info;struct list *next;struct list *Create(int *numnode)/創(chuàng)建一個(gè)鏈表struct list *head,*tail,*cnew;head=NULL;int num;printf("

3、;輸入數(shù)據(jù)(以零結(jié)束):");while(1) scanf("%d",&num); if(num=0)/輸入為零表示輸入結(jié)束 break; cnew=(struct list*)malloc(sizeof(struct list); cnew->info=num; cnew->next=NULL; if(head=NULL)/若為空則將頭節(jié)點(diǎn)指向新節(jié)點(diǎn) head=cnew; else tail->next=cnew;/將當(dāng)前節(jié)點(diǎn)的next指向新的節(jié)點(diǎn) tail=cnew; (*numnode)+;return head;void inse

4、rt(struct list *h,int i,int x) struct list *p,*t; int j; p=h; j=0; while(p!=NULL&&j<i-1) p=p->next; j+; if(j!=i-1) printf("overflow!"); else t=(struct list*)malloc(sizeof(struct list); t->info=x; t->next=p->next; p->next=t; struct list *insert_head(struct list *h,

5、int x) struct list *p,*t; p=h; t=(struct list*)malloc(sizeof(struct list); t->info=x; t->next=h; return t;struct list *Delete_head(struct list *h) struct list *p; p = h;h = h->next;free(p); return h;void Delete(struct list *h,int i) struct list *p,*s; int j; p=h; j=0; while(p->next!=NULL

6、&&j<i-1) p=p->next; j=j+1; if(j!=i-1) printf("overflow!");else s=p->next; p->next=p->next->next; free(s);void display(struct list *head)struct list *p;if(head=NULL)printf("鏈表為空,沒有數(shù)據(jù)n");return;printf("n鏈表的數(shù)據(jù)元素:n");for(p=head;p!=NULL;p=p->next

7、) printf("%d ",p->info);printf("n");int main()struct list *head1;int numnode1,point1,point2;int ne,p,q;numnode1=0;head1=NULL;/初始化將節(jié)點(diǎn)個(gè)數(shù)初始化為零head1=Create(&numnode1);display(head1);printf("n鏈表head1的節(jié)點(diǎn)個(gè)數(shù)為:%dn",numnode1);printf("input new element:");scanf(&q

8、uot;n%d",&ne);printf("nthe point of new element:");scanf("%d",&p);if(p=1) head1=insert_head(head1,ne);else insert(head1,(p-1),ne);display(head1);printf("ndelete point:");scanf("%d",&q);if(q=1) head1=Delete_head(head1);else Delete(head1,(q-1);d

9、isplay(head1);/*實(shí)驗(yàn)2，鏈表中元素的刪除，刪除失敗則插入*/#include<stdio.h>#include<stdlib.h>struct listint info;/節(jié)點(diǎn)信息struct list *next;struct list *Create(int *numnode)/創(chuàng)建一個(gè)鏈表struct list *head,*tail,*cnew;head=NULL;int num;printf("輸入數(shù)據(jù)(以零結(jié)束):");while(1) scanf("%d",&num); if(num=0)/輸

10、入為零表示輸入結(jié)束 break; cnew=(struct list*)malloc(sizeof(struct list); cnew->info=num; cnew->next=NULL; if(head=NULL)/若為空則將頭節(jié)點(diǎn)指向新節(jié)點(diǎn) head=cnew; else tail->next=cnew;/將當(dāng)前節(jié)點(diǎn)的next指向新的節(jié)點(diǎn) tail=cnew; (*numnode)+;return head;int find(struct list *head,int fab) struct list *p; int flag=0,j=0; for(p=head;p!

11、=NULL;p=p->next) j=j+1; if(p->info=fab) return j;flag=1; if(flag=0) return -1;void Delete(struct list *h,int i) struct list *p,*s; int j; p=h; j=0; while(p->next!=NULL&&j<i-1) p=p->next; j=j+1; if(j!=i-1) printf("overflow!"); else s=p->next; p->next=p->next-

12、>next; free(s); void insert(struct list *h,int i,int x) struct list *p,*t; int j; p=h; j=0; while(p!=NULL&&j<i-1) p=p->next; j+; if(j!=i-1) printf("overflow!"); t=(struct list*)malloc(sizeof(struct list); t->info=x; t->next=p->next; p->next=t;void display(struc

13、t list *head)/遍歷鏈表輸出struct list *p;if(head=NULL)printf("鏈表為空,沒有數(shù)據(jù)n");return;printf("n-鏈表的數(shù)據(jù)元素-n");for(p=head;p!=NULL;p=p->next) printf("%d ",p->info);printf("n");int main()struct list *head1;int numnode1,a,q;numnode1=0;head1=NULL;/初始化將節(jié)點(diǎn)個(gè)數(shù)初始化為零head1=Crea

14、te(&numnode1);display(head1);printf("delete:");scanf("%d",&a);q=(find(head1,a)-1);if(q<0) insert(head1,numnode1,a); else Delete(head1,q); display(head1);/*實(shí)驗(yàn)3，課本習(xí)題，自動(dòng)判斷位置并插入，鏈表實(shí)現(xiàn)*/#include<stdio.h>#include<stdlib.h>struct listint info;struct list *next;stru

15、ct list *Create(int *numnode)/創(chuàng)建一個(gè)鏈表struct list *head,*tail,*cnew;head=NULL;int num;printf("輸入數(shù)據(jù)(以零結(jié)束):");while(1) scanf("%d",&num); if(num=0)/輸入為零表示輸入結(jié)束 break; cnew=(struct list*)malloc(sizeof(struct list); cnew->info=num; cnew->next=NULL; if(head=NULL)/若為空則將頭節(jié)點(diǎn)指向新節(jié)點(diǎn) h

16、ead=cnew; else tail->next=cnew;/將當(dāng)前節(jié)點(diǎn)的next指向新的節(jié)點(diǎn) tail=cnew; (*numnode)+;return head;void insert(struct list *h,int i,int x) struct list *p,*t; int j; p=h; j=0; while(p!=NULL&&j<i-1) p=p->next; j+; if(j!=i-1) printf("overflow!"); else t=(struct list*)malloc(sizeof(struct li

17、st); t->info=x; t->next=p->next; p->next=t; struct list *insert_head(struct list *h,int x) struct list *p,*t; p=h; t=(struct list*)malloc(sizeof(struct list); t->info=x; t->next=h; return t;int find_position(struct list *head,int n_ew) struct list *p; int flag,j=0; for(p=head;p!=NU

18、LL;p=p->next) j=j+1; if(n_ew<=p->info) return j;flag=1;break; void display(struct list *head)struct list *p;if(head=NULL)printf("鏈表為空,沒有數(shù)據(jù)n");return;printf("n鏈表的數(shù)據(jù)元素:n");for(p=head;p!=NULL;p=p->next) printf("%d ",p->info);printf("n");int main()struct list *head1;int numnode1,point1,point2;int ne,p;numnode1=0;head