數(shù)據(jù)的結(jié)構(gòu)實(shí)驗(yàn)的1

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

2、malloc.h>typedef char ElemType;typedef structElemType *elem;intlength;intlistsize;SqList;/ 定義結(jié)構(gòu)體void InitList(SqList &L)L.elem=(ElemType*)malloc(10*sizeof(ElemType);L.length=0;L.listsize=10;/初始化精彩文檔實(shí)用標(biāo)準(zhǔn)文案void CreateList(SqList &L,int n)printf("輸入字符串：");int i=0;for(i;i<n;i+)sc

3、anf("%c",&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")

4、;elseElemType *q = &(L.elemi-1);for (p = &(L.elemL.length-1); p>=q; -p) *(p+1) = *p;*q = e;+L.length;/插入精彩文檔實(shí)用標(biāo)準(zhǔn)文案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 Mergeli

5、st(SqList 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 &&a

6、mp; pb <= pb_last)if(*pa >= *pb)*pc+ = *pa+;else*pc+ = *pb+;while(pa <= pa_last)*pc+ = *pa+;while(pb <= pb_last)精彩文檔實(shí)用標(biāo)準(zhǔn)文案*pc+ = *pb+;/合并int main()SqList La;InitList(La);CreateList(La,8);ElemType e;int i;printf("輸入插入位置及字符：");scanf("%d %c",&i,&e);ListInsert(La,

7、i,e);Show(La);printf("n");fflush(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(L1);InitList(L2);精彩文檔實(shí)用標(biāo)準(zhǔn)文案CreateList(L1,8);Show(L1

8、);fflush(stdin);CreateList(L2,6);Show(L2);Mergelist(L1,L2,L3);Show(L3);3.+4. 代碼：#include<stdio.h>#include<malloc.h>精彩文檔實(shí)用標(biāo)準(zhǔn)文案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(

9、"輸入字符串：");L = ( LinkList )malloc( sizeof(LNode) );L -> next = NULL;int i;LinkList p = ( LinkList)malloc( sizeof(LNode) );L = p;for( i = 0;i < n;i+)LinkList q = ( LinkList )malloc( sizeof(LNode) );scanf("%c",&q -> a);q -> next = NULL;p -> next = q;p = q;count +;

10、 / 創(chuàng)建鏈表void Show(LinkList L)LinkList p = ( LinkList )malloc( sizeof(LNode) );精彩文檔實(shí)用標(biāo)準(zhǔn)文案p = L -> next;printf("字符串為： ");while( p )printf("%c",p -> a);p = p -> next;printf("n");/輸出鏈表int ListInsert( LinkList &L,int n,char K)if( L ->next = NULL)printf("鏈

11、表為空！ n");return 0;else if(n > count + 1)printf("插入位置不合法！n");return 0;elseLinkList p = ( LinkList)malloc( sizeof (LNode);if( n = 1)p -> a = K;p -> next = L -> next;L -> next = p;精彩文檔實(shí)用標(biāo)準(zhǔn)文案else if( n = count + 1)p = L -> next;while( p -> next )p = p -> next;LinkL

12、ist q = ( LinkList )malloc( sizeof (LNode);p -> next = q;q -> a = K;q -> next = NULL;elseint i;p = L;for( i = 1;i < 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

13、,int n)if( L -> next = NULL)精彩文檔實(shí)用標(biāo)準(zhǔn)文案printf("鏈表為空！ n");return 0;else if( n > count )printf("刪除位置不合法！n");return 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 -

14、> next;if( n = count )p -> next = NULL;elseLinkList q = ( LinkList )malloc( sizeof (LNode);q = p -> next;p -> next = q -> next;free(q);精彩文檔實(shí)用標(biāo)準(zhǔn)文案/刪除void MergeList(LinkList &La, LinkList &Lb, LinkList &Lc) LinkList pa, pb, pc;pa = La->next;pb = Lb->next;Lc = pc = La;w

15、hile (pa && pb) if (pa->data <= pb->data) pc->next = pa;pc = pa;pa = pa->next;else pc->next = pb;pc = pb;pb = pb->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");精彩文檔實(shí)用標(biāo)準(zhǔn)文案LinkList L2;Createlist(L2,9);Show(L2);int j;printf("輸入刪除元素的位置：");scanf("%d",&j);ListDelete(L2,j);Show(L2);fflush(stdin);printf("n");LinkList La;printf("