数据结构.doc

数据结构#includestdio.h#includestdlib.h#define MAXSIZE 100typedef int Datatype;typedef structDatatype aMAXSIZE;int Size;Sequence_list;void init(Sequence_list *slt)slt-Size=0;Sequence_list found(Sequence_list slt)Datatype x;if(slt.Size=NULL)printf(n创建一个顺序表请输入顺序表的元素（以-1未结束，空格或Enter键间隔）：n);elseprintf(n重新创建一个新顺序表（替换原顺序表,以-1结束，空格或Enter键间隔）：n);scanf(%d,&x);while(x!=-1)slt.aslt.Size=x;slt.Size+;scanf(%d,&x);if(slt.Size)printf(*顺序表创建成功！*nn);elseprintf(*顺序表创建失败！*nn);return slt;void find(Sequence_list *slt1)int num,i=0;Datatype temporary;printf(查找方式：1.按给定值查找 2.按给定位置查找n请输入查找方式：);scanf(%d,&num);switch(num)case 1:printf(查找值查找n请输入查找的值：);scanf(%d,&temporary);while(iSize&slt1-ai!=temporary)i+;if(iSize)printf(值 %d 在顺序表中是第 %d 个元素n,temporary,i+1);elseprintf(没有要查找的值或此顺序表为空！n);break;case 2:printf(查找位置查找n请输入查找第n（整数）个节点：);scanf(%d,&temporary);if(temporary=slt1-Size)printf(没有要查找节点的位置或者顺序表为空！n);elseprintf(第 %d 个节点的值为 %d n,temporary,slt1-atemporary-1);break;printf(此项正常);void insert(Sequence_list *slt1)int position,i;Datatype temporary;printf(请输入插入节点的位置：);scanf(%d,&position);printf(请输入插入节点的值：);scanf(%d,&temporary);if(slt1-Size=MAXSIZE)printf(n顺序表是满的！没法插入！);exit(1);if(positionslt1-Size)printf(n指定的位置不存在或者后继无节点！);exit(1);for(i=slt1-Size;iposition;i-)slt1-ai=slt1-ai-1;slt1-aposition=temporary;slt1-Size+;printf(此项正常);void del(Sequence_list *slt1)int num,i=0,temporary;printf(删除方式：1.按给定值删除 2.按给定位置删除：);scanf(%d,&num);switch(num)case 1:printf(删除值删除n请输入删除的值：);scanf(%d,&temporary);while(iSize&slt1-ai!=temporary)i+;if(iSize)for(i=i-1;iSize-1;i+)slt1-ai=slt1-ai+1;slt1-Size-;elseprintf(顺序表中没有值 %d 节点这个,temporary);break;case 2:printf(删除节点删除n请输入删除的节点：);scanf(%d,&temporary);if(temporary=slt1-Size)printf(制定节点的位置不存在！n);exit(1);for(i=temporary;iSize-1;i+)slt1-ai=slt1-ai+1;slt1-Size-;break;void show(Sequence_list slt)int i;if(!slt.Size)printf(n顺序表是空的！n);elseprintf(*n);for(i=0;i ,slt.ai);printf(n*n);void max(Sequence_list *slt)if(slt-Size=0)printf(顺序表为空！没有最大值！);elseDatatype max=slt-a0;int i,temporary;for(i=0;iSize;i+)if(maxai)max=slt-ai;temporary=i+1;printf(顺序表中第%d项最大，值max=%dn,temporary,max);printf(此项正常);Sequence_list inversion(Sequence_list *slt)Datatype temporary;int i;if(slt-Size=0)printf(顺序表为空！此功能无效！);elsefor(i=0;iSize/2;i+)temporary=slt-ai;slt-ai=slt-aslt-Size-1-i;slt-aslt-Size-1-i=temporary;printf(此项正常);return *slt;void main()Sequence_list slt,*slt1=&slt;init(slt1);int num;doprintf(请输入操作相应功能的序号：);scanf(%d,&num);switch(num)case 1:slt=found(slt);break;case 2:find(slt1);break;case 3:insert(slt1);break;case 4:del(slt1);break;case 5:sh