1、、實驗?zāi)康?、學(xué)習(xí)線性表的順序表示和實現(xiàn)，會進(jìn)行順序表的插入、刪除、合并2、學(xué)習(xí)線性表的鏈?zhǔn)奖硎竞蛯崿F(xiàn)，會進(jìn)行鏈表的插入、刪除、合并二、實驗內(nèi)容1、編程實現(xiàn)：（1）在順序表ajcniydu的第三個位置插入 p。（2）刪除順序表ajcniydu第三 個位置的元素。2、編程實現(xiàn)將順序表 acdijtuy和cfklns合并。3、編程實現(xiàn)：（1）在鏈表asdfghjkl的第四個位置插入 z。（2）刪除順序表asdfghjkl第四個 位置兀索。4、編程實現(xiàn)兩個有序鏈表adfi和cefi的合并。三、實驗步驟1.+2.代碼：#include<stdio.h>#include<malloc.

2、h>typedef char ElemType;typedef structElemType *elem;int length;int listsize;SqList;/定義結(jié)構(gòu)體void InitList(SqList &L)L.elem=(ElemType*)malloc(10*sizeof(ElemType);L.length=0;L.listsize=10;/初始化void CreateList(SqList &L,int n)printf("輸入字符串：")；int i=0;for(i;i<n;i+)scanf("%c&quo

3、t;,&L.elemi);L.length+;"/賦值void Show(SqList L)int i=0;printf("字符串：")；for(i;i<L.length;i+)printf("%c",L.elemi);printf("n");/顯示int ListInsert(SqList &L, int i, ElemType e)ElemType *p;if (i < 1 | i > L.length+1)printf("插入位置不合法! n");elseElemT

4、ype *q = &(L.elemi-1);for (p = &(L.elemL.length-1); p>=q; -p) *(p+1) = *p;*q = e;+L.length;"/插入int ListDelete(SqList &L,int i)if(i > L.length|i<=0)printf("位置不合法n");elseint j = i-1;for( j;j<L.length;j+)L.elemj = L.elemj+1;L.length-;"/刪除void Mergelist(SqList

5、 La,SqList Lb,SqList &Lc)ElemType *pa,*pb,*pc,*pa_last,*pb_last;pa = La.elem;pb = Lb.elem;pa_last = pa + La.length - 1;pb_last = pb + Lb.length - 1;Lc.listsize = Lc.length = La.length + Lb.length;pc = Lc.elem = (ElemType *)malloc(Lc.length*sizeof(ElemType);while(pa <= pa_last && pb &l

6、t;= pb_last)if(*pa >= *pb)* pc+ = *pa+;else* pc+ = *pb+;while(pa <= pa_last)* pc+ = *pa+;while(pb <= pb_last)* pc+ = *pb+;/合并int main()SqList La;InitList(La);CreateList(La,8);ElemType e;int i;printf("輸入插入位置及字符：");scanf("%d %c",&i,&e);ListInsert(La,i,e);Show(La);p

7、rintf("n");flush(stdin);SqList Lb;InitList(Lb);CreateList(Lb,8);Show(Lb);printf("輸入刪除位置:");int j;scanf("%d",&j);ListDelete(Lb,j);Show(Lb);printf("n");fflush(stdin);SqList L1,L2,L3;InitList(LI);InitList(L2);CreateList(L1,8);Show(L1);fflush(stdin);CreateList

8、(L2,6);Show(L2);Mergelist(L1,L2,L3);Show(L3);D:C-languageCJ 1 .exe輸入字符串：ajcniydu輸入插入位置及字符：3 p字符串：ajpcniydu輸入字符串：ajcniydu字符串:ajcniydu輸入刪除位置：3字符串：ajniydu輸入字符串：acdijtuy輸入字符串：cfklns合并為：字符串：cfklnsacdijtuyProcess returned 0 (0x0) execution time ： 29.412 sPress any key to continue.3.+4.代碼：#include<stdio

9、.h>#include<malloc.h> typedef char ElemType;typedef struct LNodechar a;ElemType data;struct LNode *next;LNode,*LinkList;/ 定義結(jié)構(gòu)體int count = 0;void Createlist(LinkList &L,int n)printf("輸入字符串：")；L = ( LinkList )malloc( sizeof(LNode);L -> next = NULL;int i;LinkList p = ( LinkLi

10、st)malloc( sizeof(LNode);L = p;for( i = 0;i < n;i+)LinkList q = ( LinkList )malloc( sizeof(LNode);scanf("%c",&q -> a);q -> next = NULL;專業(yè) word可編輯p = q;count +;"/創(chuàng)建鏈表void Show(LinkList L)LinkList p = ( LinkList )malloc( sizeof(LNode);p = L -> next;printf("字符串為：&quo

11、t;)；while( p )printf("%c",p -> a);p = p -> next;printf("n");/輸出鏈表int ListInsert( LinkList &L,int n,char K)if( L ->next = NULL)printf("鏈表為空！ n");return 0;else if(n > count + 1)printf("插入位置不合法！ n");return 0;elseLinkList p = ( LinkList)malloc( siz

12、eof (LNode);if( n = 1)p -> a = K;專業(yè) word可編輯p -> next = L -> next;L -> next = p;else if( n = count + 1)p = L -> next;while( p -> next )p = p -> next;LinkList q = ( LinkList )malloc( sizeof (LNode);p -> next = q;q -> a = K;q -> next = NULL;elseint i;p = L;for( i = 1;i <

13、; n;i+)p = p -> next;LinkList q = ( LinkList )malloc( sizeof (LNode);q -> a = K;q -> next = p -> next;p -> next = q;count +;/插入int ListDelete( LinkList &L,int n)if( L -> next = NULL)printf("鏈表為空！ n");return 0;else if( n > count )printf("刪除位置不合法！ n");retur

14、n 0;elseLinkList p = ( LinkList )malloc( sizeof (LNode);p = L -> next;if( n = 1 )L -> next = p -> next;free(p);elseint i;for( i = 1;i < n - 1;i+)p = p -> next;if( n = count )p -> next = NULL;elseLinkList q = ( LinkList )malloc( sizeof (LNode);q = p -> next;p -> next = q ->

15、 next;free(q);刪除void MergeList(LinkList &La, LinkList &Lb, LinkList &Lc) LinkList pa, pb, pc;pa = La->next; pb = Lb->next;Lc = pc = La;while (pa && pb) if (pa->data <= pb->data) pc->next = pa; pc = pa; pa = pa->next;else pc->next = pb;pc = pb; pb = pb->

16、next; pc->next = pa ? pa : pb;free(Lb);"/合并int main()LinkList L1;Createlist(L1,9);Show(L1);char b;int i;printf("輸入插入位置和插入元素：");scanf("%d %c",&i,&b);ListInsert(L1,i,b);Show(L1);fflush(stdin);printf("n");LinkList L2;Createlist(L2,9);Show(L2);int j；printf(&

17、quot;輸入刪除元素的位置：")；scanf("%d",&j);ListDelete(L2,j);Show(L2);flush(stdin);printf("n");LinkList La;printf("輸入需合并的兩組字符串！ n");Createlist(La,4);Show(La);flush(stdin);LinkList Lb;Createlist(Lb,4);Show(Lb);LinkList Lc;MergeList(La,Lb,Lc);Show(Lc);return 0;D:C-languageCJ 1.exe輸入字符串：asdfghjkl字符串為：asdfghjkl匾又插入彳立置粕插入元素：4 z 字符串為:asdzfghjkl輸入字符串：asdfghjkl字符串為：asdfghjkl 金入