




版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
8576JI财线性表的基械作时间限制:1000MS内存限制:1000K想带数9027通过雌2456®辎题语言无限制Description编写算法,创建初始化容量为USTJNHLSIZE的顺牍T,并实嫄入、删除、遍历操作。本题目给出部分代码,谢隆:内容。#ttxiude<stdioh>#indude<manoah>#defineOKl#defineERROR0#defineUSTLINrrjSIZE100#defineLISTINCREMENT10#defineEhmTypeinttypedefstruct(int*elem;intlength;intlistsize;JSqList;intInitLiscSq(SqList&L)(//雌23,树心寸翎幽牌L, 卜为USIJNIILSIZE〃武隆代码imLoadjSq^qList&L)//输出J恻禄所有标inti;一 )printfClLeListis«iytyT)://请鳏eke|printffUieLjstis:");for( )printfC%d", );//请蟀}printff'n');returnOK;)intLisdnsert_Sq(SqIjst&Ljntijnte){//算法24,在顺序辘表L中第i个位置之前插A新的元素e//i 1<i<Uength+1〃耐全代码intListDdet^_Sq(SqList&Ljnti,int&e)//算法25在初硬性表L中删除第i个位置的元素,并用e返回其值〃^^险代码intmainO{SqListT;Elemlypee,x;if( )//判断顺链是否创建成功{printff'ASequenceListHasCreated'n');}{printff4insertelement\n2JDeletedement\n3Ijoadalldements\nQExit\nHeasedioosc'n');scanf^*%dM,i&a);switrh(a){scanff1%d%d,,^&x);ifi: JprintfCInsertEttorfH)"/判断i值是否合法,elseprintffTheElement%disSuccessfullyInserted!\nH,x);break;scanff1%d”闻;if()printfTDeleteEaoriW);〃判断i值是否合法,elseprintffTheElement%disSuccessfullyDdetedl'n”,e);break;Load_Sq(I);break;case0:return1;})的做测试样例格式说明:根辘单操作:1、输入1,表示要实现脚斓作,紧跟着要输入插入的位野玩素,用空格分开2、^A2,表示要卖现删I娥作,紧跟着蟋入删除的位置3、输入3,表示要输出顺禄的所有元素朱^A0,表示程序结束输入样例1121132130输出样例ASequenceListHasCreated.1insertelement2JDdeteelement3JLoadallelementsO£xitHeasedioose:TheElement2isSuccessfullyInserted!1insertelement2JDdeteelement3JjoadallelementsftExitHeasechooseTheElement3isSuccessfullyInserted!1Insertelement2iDdeteelement3JjoadalldementsCkExitHeasechoose:TheEkment3isSuccessfullyDeJeted!1insertelement2JDdeteelement3JLoadalldementsttExitHeasechooseTheListis:21Insertelement2Ddeteelement3JLoadallelementsOExitHeasedioose:yqm1^:(jEWfe)#indude<stdioh>#irxducle<maDoah>#defineOKl#defineERRORO#defineLIST_IN1T_SIZE100#definelJSTINCREMENT10#defineEtemiypeinttypedefstruct(int*dem;intlength;intlistsize;}SqList;intInitList_Sq(SqIjst&L){//麟23, 卜为USTJNniSIZE//imt全代码Ldem=(EkmType*)maDoc(LISTJNIT_SIZE*sizeofiplemType));Uength=(XIJistsize=IISnUNrr_SIZE;returnaimLoadJSq(SqList&L)//输出J恻禄所有标inti;ifjjJengWRpHntfnheListisempty!)//请鳏eke|printffTheListis:');ftM^=^<IJengthi++)printff1%dMJ^elem0);//请填空}printff'n');returnOK;)intLisdnsert_Sq(SqIjst&Ljntijnte){//算法24,在顺锁域L中第i个位置之前插A新的元素e//i 1<iWUeng(h+1〃耐全代码Ekmlype*newbase,*p,*<j11i>Llengdi4-l)tetumERROR;if(Llengdi>=LJistsize)(newbase二(ElemType;*)tealloc(LdemXLJsts%+USTINCREMENI)*sizeof(SemType));L.dem=newbase;Llistsize+=LISnNCREMENT;)q=&(Lelemp-l]);forQ=&JdempUeng^lDP*,-!^*”尸*P++Llength;returnOK;)intListDelet^_Sq(SqList&I4nti,int&e)(//算法25,在顺序线性表L中删除第i个位置的元素,并用e返回其值〃1的命却勤l<i<Uength〃阚全代码Hemlype*p,*q;||i>IJeng^tetumERROR;p=&(Lekmf-l]);e=*pq=Ldem+Uength-l;for(++pp<=<¥++p)*(p-l)=*p;-Llength;returnOK;)inttnainO(SqListT;inta,i;Elemlypee,x;蛔List_Sq(I)) //判断顺;猱是否创建成功{printf^'ASequenceListHasCreatEd.\n");){printf^'linsertelement\n2DdetEelement\n3ijoadallekments\nttExit\nHeasechoose'n');scanff1%^—switch®{scanff,%d%d,,Ai5&x);if(ttlstInsert_Sq(Tix))printffInsertEttorf\n,1);//判断i值是否合法,请^^elseprintffTheElement%disSuccessfullyInserted!\n",为;break;scanff*%d”闻;ifiJIlstDeletjSqF^MnKDeleteEnoNf)"/判断i值是否合法,请鳏elseprintffTheElement%disSuccessfullyDdeted!\n",e);break;Load_Sq(I);break;case0:return1;}))(C++STLEst)#indude<stdioh>#indude<malloah>#inchxle<list>intmainQlist<int>T;inta,i;inte,x;printff'ASequenceListHasCteatEd'n');x^Me(l)(printff*1insertetement\n2Ddeteelement\n31joadallelements\nO£xit\nHeasechoose:\n');scanf(,,%d,,3&^;switch®{easel:scanff%d%d,,MM;晔1|BSOTsizeO+DprintfnnsertErrori'K)"/判断dseintj=l产Qlist<int>dte£atDriter=T.b^nQ;ifjj==l)(T.push_fron吩;p=l;)while$ter!=T.endO)Tjnsert^tepc);p=l;itetH;break;}else{j++;)}嵯)T.pushJ>ack(x);printffTheDement%disSuccessfullyInserted!\nM,欢)break;sc3nf^1%dn,&i);晔1||i>3TsizeO)printfCDeleteEnorfH);〃判断i值是否合法dse(intj=l;Est<int>dtetatoriter;fot8er=T.be曲OTteriHEendO汁+itei)询==5list<int>:dtEtatDttmp;tn5>=iter;e=*iter;iterl-+;T.et3se(tmp);break;)elsei++;}printfCTheElement%disSuccessfullyDeleted!\nH,e);)break;if(TenptyO)printfflheListiserqpty!\ii');dse(Hst<int>dtmtDrplist;printfflheListis:fortyfet=T.begnQ;ffet1=Tend。;pfct4-+)printfC%d"并碱;printfCV);}break;caseO:return1;)#indude<stdioh>#indude<malloah>#indude<stringh>intmainQ(intT[100q;memset(r,0^izeof(l));inta»ijk=lje>x;printff'ASequenceListHasCteated'n');(printf^*linsertdement\n2dDdeteelement\n3Jjoadallelements\nO£xit\nPleasechoose:\n');sc3nfC*%d”㈣;switch(a){easel:sc3nff^%dMMM;||i>^printfCTnsertEnorfXn1);//判断i值是否触,请填空dse{j=tl;j>=i;j-)WIE;T0Fk++;printffTheElement%disSuccessfullyInsertedl'n”,引;)break;scanff%!”出;||i>k-l)prin<TDeleteEnoriW);//再惭ieke{e=T>foi&tj=i;jvk;j++)TfflKO+1];k-;printffTheElement%disSuccessfullyDdetedl'n”,e);)break;if^k==l)printffTheListisempty!*1);dse(printffTheLstis:');forgtj=l;j<k;j++)printff%!”项;)printff'n,);break;caseChreturn1;}8577合并J厕株时间限制:1000MS内存限制:1000K版次数5339通过雌2251®辎题语言无限制Description编写算法,将两个非递减有序顺眼A和B合并成一 腱减有序顺裱C。本撕流供代码,请同学ff驰立完成,所需子遨爆考前面完峭内容。缺福第* A的甘微第二行:顺瞬A的各元素G助减),用空格分开行:顺I裱B断素微第H行:顺的鲍熊(斗睡减),用空能班输的轼第一行:顺I裱A的旗列表第二行:顺臊B的族列表第三行:合并后顺麻C的元素列表私懒5135795246810输出ListA13579ListB246810ListGl2345678910ytyn#mdude<stdioh>#indude<sttffibh>#indude<mallcxdi>#defineOKl//defineERROR0#defineUSTJNIT_SIZE100#defineLISTINCREMENT10#defineElemIypeint#defineOVERFLOW-2typedefstruct{int*dem;intlength;intlistsize;}SqList;intInitIJSt_Sq(SqList&Untn)(inti;Ldem=(ElefnIype*)maIloc(n*sizeof(ElernI^pe));LBstsize=国LJengdi=n;for^=ai<LJength;i++)scanff*%d,,^8ikelemgl);returnOK;}intLoadjSq(SqList&L)(inti;iflJJengdEJtetuma〃请鳏else{for^=ai<Uength-l;i++)printff%d^JLetemQ);printff%d"Lelem[LJengdi-lD;}//if(ch==A)di=B;//dseif(di==*B)ch-C;returnOK;)voidmergpListjSq^qListLa9sqListLb^SqList&Lc)(int*i洱*ptSxJpaJasLpbJast;pa=La.dem;pb=Lb.elein;LcJistsize=LcJengdi=LaJengjh+LbJengjh;pc=Lcelem=(ElemType*)malloc(LcJistsize*si2eof(ElemType));ifjJLaekm)exit(OVERFLOW);paJast=Ladem+Lalength-l;pbJast=Lb.elem+LbJength-l;5?diile(jpaV=p^Jast&^b<=pbJas^{ifi*pa<=*pb)*pc++=*pa+4-;else*pc++=*pb++;)while(jpa<=p^Jas^*pc+4-=*pa++;xid]ile(pb<=pbjas^*pc++=*pb++;}intmainQ{SqListTRY;inta,b;sc3nff,%d,,^&a);InitList_Sq(T^);scanfT%d”他);InitList_Sq(Rj3);metgpListjSq(rj<,Y);printfflistA:*);Load_Sq(I);printffTJstB:);LoacLSq(R);printffTistC:');Load_Sq(Y);}(C++SILlist)#indude<stdioh>#irxdude<stdlibh>#indude<malloah>#indude<list>voidload(list<int>L)Hst<int>:dtecatDrpEst;for3fct=LbegnQ;plist!=Lend。;阐+十)曲际圾厘比printW);}intn)ain0(fist<int>TR;scanff^'Aa);i<a;i++)(scanf(,*%d,,^&x);T.push_back(x);)scanff,%d,,^&b);forinti=(Xi<b;i++)scanff,%d,,^&x);R4xish_back(x);}printffTistA:');10ad(I);printffTjstB:,r);k)ad(R);Tmerge(R);printfCTistC);loadfl);)mn:(M)#inchide<stdioJi>#indude<stdlibh>#indude<stringh>intInitUsjSq皿Lfljntn){inti;碉二«ivn;i++)scanf(,1%dnJ&L0);return1;)intLoa4JSq^ntL[]jntn){inti;if(n==O)return0;〃请鳏elseprintfW现;printfC、";return1;}voidmergeListjSq^nt切血bQ3ntc|]jintajengdyntbjengdi)(inti=Oj=OJc=(Xx4iile(i<ajength&fig<bJengd^(if(a0<=b0)ck++]=班++];elsec|k++]=bO++];)^jrf)ile^<^Jength)cOc++]=ap++];xd)ile(j<bJength)cPc++]=b|j++];)intmanQ{intT[100]^[10qi,Y[100];memset(r,0^izeof(l));memset(R,0^izeof(R));memset(Y,0^izeof(Y));inta,b;scanfC%d”为;InitList_Sq(T^;scanff%d”触);InitLiscSq^b);mergdjstjSqCTRYal立printfflistA:');LoacLSqO⑶;printffTjstB:,r);Load_Sq(RJ?);printfCTistG*);Load__Sq(Y^+b);)8578顺J裱逆置时间限制ilOOOMS内存限制iIOOOK贩次物3660通过嬷2149»脸Desccption设有TlE»A=(aOR-(皿1),嬲W^^OjANan-liaUaLaq)。麟,将逆置,要求顺猱仍占用原刷禄的空间。本题襁供代码,请同学4郎完成,所需子函修考前面完成的内容。第F输A顺禄的元素个数第二行:输A顺糅的各元素,用空格分开输时髅第F:逆置踊顺锡旗列表蛆行:婚输入样例1012345678910输出TheUstis:12345678910TheturnedListkl0987654321作者ycpi#indude<stdioJhL>#indude<rnalocJh>#defineOKl#defineERROR0#defineUST_INrr_SIZE100#defineUSTINCREMENT10#defineEkmTypeinttypedefsttuct{int*elem;intlength;intlistsiz^JSqList;intInidJst_Sq(SqIJst&Tjntn){//算法23,构igT空搦捌L, 领艇以小为IIST_INrr_SIZE〃翩全代码inti;Lelem=(EtemT^pe^malkx^^zeof(Elemiype));ifjJLekm)tetumERROR;LJistsize=n;Lleng0i=(XforgaivH++)scanff,%dH3&Lelem[i]);returnOK;}intLoadJSq^qList&Ljntn)(//输出顺序表中的所有元素inti;fc»r(i=(^<r4++)printff*%d"L61cm0);printfC⑺;returnOK;)intf^SqList&I^intn)(领二①<口您++)(t=Lelem0;Ldem|3=Lelem[n-i-l];Ldem[h-i-l]=t;returnOK;intmainO{SqListT;intn;scanf(,,%d,,^8ai);InitList_Sq(T/i);printffTheListis:1*);Load_Sq(T^;fiX项printf^TheturnedListis:');LoacLSqg);)(C++STLlist)#include<stdioh>#indude<maDoah>#indude<list>usingname^jacestd;voidk)ad(list<int>L)(Bst<int>:dteratDrplist;fbr(plist=Lb^nQ;pEst!=Lend。;printfC'n))intmainO{Hst<int>T;inttyqscanff^An);ft)r(ttiti=(^<ni++)(scanff1%d,,^x);T.pushJ>ack(x);)printfj^TheListis:');k)ad(I);TjeverseQ;printffTheturnedListis:');k>ad(I);)#include<stdioh>#include<malloah>intLoa4JSq^ntL[]jntn){fca^nti=(^<nj++)print"!"现;printfC'n');return1;}int母ntL[]jint坨(inti,!;fbt^=(^L<n/2i++){『闻;L0=LM;L[n-i-l]=t;}return1;}intmainOintT[100]^;scanff1%dM^&r^;scanff^^TED;printffTheListis。Load_Sq(T^;AX电printfi^TheturnedListis:');Load_Sq(T^;}8579的线性表的基械作时间限制1OOOMS内存限制:1OOOK甄逸:5567遹此数2176蝌雌,仓有缄L并^®A、倘、蜥搦乍。椿目跚部然碣常陛内容。#inchide<stdioJi>#indude<malloah>#defineERRORO#defineOKl#defineEJernTypeinttypedefstructLNode{intdata;structLNode*next;}LNodj*UnkList;intCreateIjnlHL(LinkList&L^int坨{//犍含有n个元素的单缄LinkListp知inti;Elemlype^L=(LinkLis^maDoc(sizeof(LNode));I.>neXt=NULL; //q=(UnkLis^maDoc(sizeof(LNode));q=UforQ=(^iVn;i++){scanf^1%dM,&e);p=(LinkL^malloc(sizeo财ode)); 点〃请补全代码}tetumOK;}intLoadLinKJL/LinkList&L){〃单LinkListp=L->next;皿 )printfCIheListisempty!')://请鳏dse{printffTheLinkLstis:');wbfle() //(printff*%dMjp->data); //^&})printff'Xn");returnOK;)intLinldnsertJ(LinkList i^emlypee){〃算法29//雌珀睁〃滞隆代码intLinkDelet^JL/LinkList&L^inti,EkmType&e){//算法210〃在给给点的单雌牌L中,删除第i个元素,并用e返回其值〃朝隆代码)intmain。(LinkListT;Ekmlypex,^printffTReaseir^xitdieinitsizeofthelinklist\n,);scanff*%dMAn);printffPleaseirqxitthe%delementofthelinklist'n”,3;if( ) //{printff'ALinkListHasCreated'K);LoadLinkJ/Dj)while(l){printfi^11insertelement\n2JDdeteekment\n3ijoadallelements\nOExit\nHeasedx)ose:\n'*);scanfi;1%^㈣;switdi(a)(scanff*%d%d"'&®;一 )printffInsertEnorf\H);//判断i值是否合法,elseprintffTheElement%disSuccessful^Insertedl'n”,为;break;scanf(,*%dn^d);if()printffDdeteErroriXn**);//判断i值是否合法,elseprintffTheElement%disSuccessfullyDdeted!\n",e);break;LoadlJnkJ/I);break;case0:return1;)|)测试样例黜:说明:根解单操作:1、输入1,表示要实嫄入操作,紧S般输入插入的位置和标,用空格分开2、输入2,表示要翻删娥作,紧跟鞋输入删除的位置3、输入3,表示要输出顺洋的所有标4、输入0,表礴序结束触的3369341230输出样例ReaseinputtheinitsizeofdielinklistHeaseinputthe3elementofthelinldistAIJnkListHasCreated.TheLinkListis:369insertelement2£Heteelement3dLx)adallelementsOExitReasedxx)se:TheIinkListis369ldnsertelement2JDdeteelement3LoadallelementsQExitPleasediooseTheElement12isSuccessfullyInserted!insertelementZDdeteelement3JloadallelementsOExitHeasechoose:TheElement3isSuccessfiillyDeleted!1insertelement2Ddeteelement31x>adallelementsOExitReasedioose:TheLinkListis69121insertelement2Ddeteelement3dLoadallelements0£xitReasedxx>se:悌ytpn»-:GBSm)#indude<stdioJi>#indude<malloah>//defineERRORO#defineOKl#defineElemlypeinttypedefstructLNode{intdata;structLNode*next;}LNode,*LinkList;intCreate!inkjink!ist&L4ntri){//创建含有n个蔗的单僦UnkListp知inti;Elemlype^L=(LinkLis^maDoc(sizeof(LNode));I^next'NULL: // 朝单缄q=(LinkDs^maDoc(sizeof(LNod^);q=LforQ=(XiVn;i++){scanfV1%d*,,&e);p=(LinkL城)malloc(siz8@Node));//生成新结点p->dala=^p->next=q->next;q->next=p;q=p}returnOK;intLoadLinUXUnkList{〃单LinkListp=L->next;g=NULDprimfnheListisen^ty!');〃请填。dse{printffTheLinkListis:');wbile(p!=NULQ//printff*%dMp->data);p=p->next;//请霹})printff'n');returnOK;)intLinldnsenJ/LinkListfid-5inti^lemlypee){〃算法29//螂珀睁〃请#全代码LinkUstpjS;intj;叩j=o;while(p&&j<i-l)(p=p->next;++j;}ifl^||j>i-l)retumERROR;s二(LinkLisOmafloc(sizeof(LNoda);s->dala=e;s->next=p->next;p->next=s;returnOK;intLinkDelet^L(IJnW^5t i,Elemlype&e){//算法210〃在黔啰点的单麒性表L中,删除第i个稼,并用e返回其值〃请#全代码LinkListp^q;intj;叩用vdifle(p>>next&&jvLl)(p=p->next;++j;)ifij(l>>nex^11j>irl)retLimERROR;q=p->next;p->next=q->next;e=q->dat2;fee©;returnOK;}inttnainO{LinkListT;inta/ij;Elemiypex,qprintffTMeaseinputdieinitsizeofthelinldist\n,^;scanff^An);printfVTMeaseinputthe%delementofthelinklist\nM,哈ateLiriU/Ta)) //判断球是酬建成功,请鳏{pontff*ALinkListHasCreated'n");LoadLinkJLfl);)while(l){printf^*linsertelement\n2DeletEeleinent\n3ijoadalldements\nOExit\nPleasechoosu'n');scanfC1%dM,&a);switdi(a){scanff*%d%dH^i&^;卸LinkJnserdLfTX^printfCInsertEnorf'O"/判断i值是否能,请舞elseprintffTlieElement%disSuccessfullyInsertEd!\nH,项break;scanff*%d”闻;ifiJLinkDeleteJL(rie))printfCDeleteEnorfH);〃判断i值是否合法,请鳏elseprintffTheElement%disSuccessfullyDeletedl'n”,e);break;LoadLinkJLfl);break;caseftreturn1;^feZ2(C++STL%#indude<stdioJi>#indude<malloah>#indude<list>usingname^acestd;voidk>ad^ist<int>E)(if(LsizeO==0)pontf('rnieListisen^tyf);else{printffTheLinkListis:');Iist<int>:dter3torplist;fijr(fJist=Lb锢nQ;pBst!=Lend。;printfT%d",*plisO;print<'\n');)}intmainO(Bst<int>T;printffTleaseinputtheinitsizeofthelinklist\n*);scanfl^M;printffTleaseinputthe%delementoftbeHnklist\nM,n);printff*ALinkListHasCteated\n');for『0^vg++)scanff*%cr-T.puslt_back(x);loadfl);xdiile(l)(printff11insertdement\n2J2)eleteelement\n3ix>adallelements\nOJExit\nPleasechoose:\H);scanf^,%d,,j&a);switrh(a){easel:scanfff%d%dr,3&^&x);if^<l||i>^T^izeO+l)printfflnsertEnoriXn");//判断i值是否合法dse{时=1Q前list<inC>diEratDriter=T.begnQ;%==1){T.push_fiont(x);p=l;}wHe(jter!=T.endO)(if(j==i&&i!=l)(Tjnsert^terX);p=l;iter++;break;)elsej++;))悔)T.pushJ)ack(x);printffTheElement%disSuccessfiiDyInsertedl'n”,0;)break;caseZscanf^1%d"出;|i>$nt)T^izeO)printffDdeteEnori\n,r);//idse(intj=l;list<int>dte£atDriteqfot@er=T.be曲OjiterKmdO汁+itet){询=习{Est<int>:dtEt3tDrtn^j;trqf>=itet;e=*igT.erase{tm^;break;▼eke++pin角TheElement%disSuccess&DyDdeted!\5A}break;case3:loads;break;caseQreturn1;廿indude<stdio.hv#indude<malloc.hv#include<stringhvB-tmaino{intTHOOq」memsetfrajsizeof^l});inta,i,k=l,e,x,n;pdntffTleaseinpurtheinitsizeofdieHnkHst/5;scanfc%d・£;printffTleaseinputthe%delementofthefotgti=l;i<=n;i++)scanf(,,%d,,3i&T0);printff*ALinkListHasCteated'n');ifljc==l)printffTheListiselse{printffTheLinkListis:');forintj=l;j<k;j++)print《%dM,T(j]);}(printf^*linsertdement\n2dDdeteelement\n3Jjoadallelements\nO£xit\nPleasechoose:\n');sc3nfC*%d”㈣;switch(a){easel:scanf(,,%d%d,,MM;晔1||i>®printfTInsertEnorfH);〃判断i值是否触,请填空dse{j=tl;j>=i;j-)WIE;T0Fk++;printffTheElement%disSuccessfiiDylnsertedl\nM,药;)break;scanff%!”出;||i>k-l)prin<TDeleteEnoriW);//再惭ieke{e=T>foi&tj=i;jvk;j++)k-;printffTheElement%disSuccessfullyDdetedl'n”,e);)break;if^k==l)printffTheListisempty!*1);dse(printffTheLinkListis:");fot<jntj=l;j<k;j++)prin或1%d"阿;)printff'n,);break;caseChreturn1;}8580时间限制:1000MS内存限制:1000K版次数3724通过缄fc2077®辎题语言无限制Description设I#法将两眼降减有序球A和B合并成一 腱减有序球Co本题襁供代码,请同学他蚊完成,所需子觥参考之前完成的内容。缺福第F:单僦A的甘微第二行:单链表A的各元素俳递减),用空格分开行:的元素个数第H行:单球B的酶熊(斗睡减),用空能班输的轼第一行:单僦A的旗列表蛆行:单球艰第三行:合并后单球C的元素列表私懒6122445628496415317586输出ListM22445628496ListB:15317586ListG12152431456275848696悻ytynm-:(om)#indude<stdioh>#indude<mallcxdi>#defineERROR0//defineOKI#defineEkmlypeinttypedefstructLNode(intdata;structLNode*next;}LNode,*LinkList;intCreateLinkJ/^kList&Untn){//创建含有nef素的单僦LinkListp知inti;Elemlypee;L=(LinkLis^maDoc(sizeof(LNod^));I.>next=NULL; // 单球q=(LinkLi咖加oc(siz8f(LNod勃;q=L;forG=aiVn;i++){scanf^%!”,&e);p二(LinkList)malloc(sizeof(LNode));// 点p->data=^p->next=q->next;q=preturnOK;intLoadUnkJ/LinkList&L){〃单LinkListp=L->next;ifi^=NULE)printff'TheListisempty!");//请填空ydde(p!=NUIJJ)//1#^(printf("%d"p->data);p=p->nest;//请^空})printff'n');returnOK;voidMergpListLL(LjnkLjst&LaJ_inkList&Tb,TjnkTist&Lc^LinkListpa^jbpc;pb=Lb->next;Lc=pc=La;x)diile(pa&&pb)(ifijpa->data<=pb->data)(pc->next=pa;pc=pa;pa=pa->next;)else{pc->next=pb;pc=pb;pb=pb->next;))pc->neoct=pa?pa^b;ftee(Lb);}intmainO(IinkUstT,Y,Qinta»b;scanff1%dM,i&a);CreateLinkJfT秋scanff*%^触);CreateIJnkJL(Y,b);printfCUstA?);LoadlinkJLfI);printffTJstB:11);LoadIjnk_L(Y);MergdJstJ/r,Y,Q;print埒listG');LoadIink_L(C);}解法二:(C++STLlist)和8577合用厕裱解法二一样解法H:偻组)和8577合并顺猱解一样8581线时间限制:1000MS内存限制dOOOK提交次数2811通过次数2032醒:雌题语言无限制Description设有(30凡_>(皿1), A'=(an-V,a^al,a0),逆置,要雌性表仍占用殿性赛<J空间。本题襁供代码,请同学假霞立完成,所需子微—之前完成的内容。第f的n,标单缄帧素个数第二行:输入单够的颉素,用空格分开输出I物;第一行:输出单缄逆置前的元素列表第二行:输出单麋逆置后的元素列表输入样例3297546535846175输出样例Thelistis3297546535846175TheturnedListis:7561843565549732候#indude<stdioh>#indude<maloah>#defineERROR0//defineOKI#defineEhmIypeinttypedefstructLNode(intdata;structLNode*next;}LNode,*LinkList;intCreateLinkJ/LinkList&Ijntn){//创建含有n伤素的单触LinkListp知inti;Elemlypee;L=(LinkIisi)maDoc(sizeof(LNod^));L>next=NULL;//先建立熠点球q=(LinkLis^maDoc(sizeof(LNod^));q=LforG=(XiVn;i++){scanff,%dM,&e);p=(LinkDst)manoc(sizeof(LNode));// 点p->data=^p->next=q->next;q->next=p;q=p)returnOK;)intLoadLinkJ/LinkList&p{〃单LinkListp=Lr>next;ifiJp==NULQprintffTheListisen^tyT);〃请dse(wMe(p!=NULp//{printf<"%d"p->dala);p=p->nest;//请})printff\n");returnOK;intinvertoLofder(LinkList&L)(LinkListp=Lr>next^Jh;q=p->next;p->next=NULL;whfle^!=NULE)(h^p;P=<5q=p->next;p->next=h;}L->next=p;returnOK;}intmainQ(LinkListT;intn;scanff,%dnJi&n);CreateLinkJ/T欣printfCTheListis:');LoadIinlUL(I);invettecLotderfl);printffTheturnedListis?);LoadLinkJ/I);解法(++511版)和8578顺铺鳍解忙一样解法H:徵组)和8578顺糅逆I解法H一样8583顺序班基械作时间PgMlOOOMS内存蝌:1000K贩次庭4189通过嬷2059整脸Descrption创建f空的顺序栈,并翅栅)入栈、出栈、返回鄙胀度、返回栈顶元素、懒I遍历建随法。WTWW补#inchide<mallocji>#indude<stdioh>#defineOKl#defineERRORO#defineSTACK_INIT_SIZE100//存端蒯始邠遑#defineSTACKINCREMENT10//存储空间分配增量typedefintSEkmType;//定义栈元彩性typedefintStatus;//Status 如OK等structSqStadc{SEkmType*base;// baseNULLSElemType*tcp;//WWW-intstacksiz^//当前已分配的存储型间,以元素为单位);//3娱StatusInitStack(S<jStack&S)//构苣栈S,该频定义大小为STAGKJNTILSIZE〃请#全代码StatusPush(SqStack&S3ElemIypee)//碘s〃翱全代码StatusPop(SqSt2ck&S,SElemIype&e)〃若胡空,贝删除s的栈顶元素,用e返回其值,并返回OK;否则返回ERROR补^代码}StatusGeffqXSqStackS3EkmType&e){〃若窗空,则用0顾56«^,fflHlOK;砌崛ERROR//imt全代码)intStackLengfh(SqStackS)〃返回栈S的元素储〃请#全代码//从栈陲胺底依次鼬的蹒打蔑SElemType*p=QElemType^malkx^sizeofi^Elemlype));P= //it^if( )printffTheStackisEnqjtyf);〃 空else|printffTheStadeis:P-;wMe( ) //i#^(printfT%d”,*p); //^&))printf("\n");returnOK;}intmainQ{inta;SqStackS;SElernlypex,e;printff*AStackHasCreatoi'n');}vdnle(l)|printff4Push\n2JPop\n3<jettheTop\n4:RetumtheLengthoftheSt2ck\n5JLoadtheStack\nOExit\nHeasechoose'n');scanff,%dMj&a);switrh(a)(case1:scanff1%dn,&x);ifl: )由1岚如shEnorf\n)〃判断Push是否雒,请鳏dseprintffTheElement%disSuccessfullyPushed!\nM,x);break;caseZifi;)printfi^PopEngn〉;〃判断Pop是否合法,请dseprintf^TheEkment%disSuccessfullyPcped!\nM,e);break;if( )printff'GetTopErtorf'H);〃判断GetTop是否合法,请填空dseprintffTheTopElementis%d!\nH,e);break;printff*TheLengdiofAeStackis%d!\nM,);//空break;//i#^break;case0:return1;测试样例格式说明:根僦单操作:1、输入1,表示要翊Push操作,紧跟着输入要Push的元素2、输入2,表示要题Pop操作3、^A3,返0栈瓯素4、^A4,返0栈的元g个数5、输入5,表示从栈顶到W獭出榭<J所有元素6、输入0, 球输入样例1214165342522输出样例AStackHasCreatedlPush^op3<SetdieTop4:RetumtheLengthoftheStack5dLoaddieStack0£xitReasedxx>se:TheElement2isSuccessfullyPushed!lPush^op3KJettheTop4:RetumtheLengthoftheStaci5JLoaddieStackOExitHeasedxx)se:TheElement4isSuccessfullyPushed)lPush2Pop3<SettheTop4:RetumtheLengdioftheStade5JloaddieStackOExitHeasechoose:TheElement6isSuccessfiillyPushed!lPush2Pop3<}ettheTop4:RetumtheLengthoftheStack5JLoaddieStackOExitReasedxxjse:lheStackis:642lPush2dPop3<}ettheTop4:RetumtheLengthoftheStack5dLoaddheStackOExitReasedxx)se:TheTopElementis61lPush2Pop3K3etthelbp4:RetumtheLengthoftheStack5dLoadtheStackOExitReasedxx»e:TheLengthoftheStackis3!lPush洋叩3<jettheTop5JjoadtheStackO£xitBeasediooseTheElement6isSuccessfullyPoped!lPush^op3<SetdieTop4:RetumtheLengthoftheStack5dLoaddieStack0£xitReasedxx>se:TheStackis:42lPush^op3KJettheTop4:RetumtheLengthoftheStaci5JLoaddieStackOExitHeasedxx)se:TheElement4isSuccessfullyPoped!lPush2Pop3<SettheTop4:RetumtheLengdioftheStade5JloaddieStackOExitHeasechoose:TheElement2isSuccessfiiDyPoped!lPush2Pop3<}ettheTop4:RetumtheLengthoftheStack5JLoaddieStackOExitReasedxxjse:PopError!lPush2dPop3<}ettheTop4:RetumtheLengthoftheStack5dLoaddheStackOExitReasedxx)se:作#ycpn»-:(lEWfe)#include<malloah>#indude<stdioh>#indude<stdlibh>#defineOKl#defineERROR0#defineSTACKJNIT_SIZE100//#defineSTACKINCREMENT10//存储空间分配增量#defineOVERFLOW-1typedefintSElemType;//定义栈元素typedefintStatus;"Status是函数的翘淇值是函数结果状态代码,如OK等structSqStack(SElemType*base;// baseNULLSElemType*tip;//WW&tfintstacksize;//当前已分配的存储空间,以元素为单位};//StatusInitStackf&jStack&S)(//构新空栈S,该椀娓没小为STACKUNTILSIZE〃请#全代码S.base二©ElemTyp^*)maBoc(^TACKl_JNriLSIZE*sizeofi^ElemType));if(!S.base)exit(OVERFLOV^;S.top=S.bas^S.stadcsize=STACKJ^nLSIZ^returnOK;)StatusPushfSq^tack&S3ElemTypee)(//磁S e〃滞隆代码ifi^.trp-S.base>=S.stacksize){S.base=(SElemType^realloc(S.base,(S^tadffiize+STACKINCREMENI)*sizeofi^Elemlyp^);ifiJS.base)exit(OVERFLOW);S.tqp=S.base+S^ta(isiz^S.stacksize+=STACKINCREMENrr;)*S.top++yreturnOK;}StatusPop(SqSt2ck&S3ElemIype&e)(〃若栈罹,则删除s的栈顶元素,用e返回其值,并返回OK;否则返回ERROR〃明全代码ifiStop==S.bas啦etumERROR;e=*-S.tqp;returnOK;}StatusGe€Tqp(SqSt2ckS3Ekmlype&e)(//^^,贝(!用e鹿 ^MOK;砌蝴ERROR〃瀚隆代码ifi^.t£p==S.base)tetumERROR;e=*(S.top-l);returnOK;}〃返回栈S的元素个数〃请I陛代码returnS.tt4>S.base;}StatusStackTraverse^StackS)(U从栈飕胺底依次鼬的瞬1日SElemType*p=(SElemlype*)malloc(si2eofjJSElemTyp^));p=Stopifi^.base==S.top)pflntffTheStackisEmptyf);〃请第5else(printffTlieStadeis:P-;while(p+l!=S.base) //W^{pflntfC%dM,*p);)}printO;returnOK;}intmainQSqStackS;SElemlypex,^iflJnitStack®)//声惭{printff*AStackHasCreated'n');)xdde(l){printff*lJ?ush\n2JPop\n3K3etdieTop\n4iletumAeLengthoftheStack\n51joaddieSt2ck\n(kExit\nHeasechooseXn**);scanffl%d,,^&^;switdi(a)(scanff,%dM,&x);if(JPushQMprintfCPushEnorfW);〃判断Push是否合法,请dseprintffTheElement%disSuccessfullyPushed!\nn,勾;break;ifiJPcp(S^))printfV'PopEnoriXn**);//判断的是否合法,请dseprintffTheElement%disSixxessfiillyPoped!\nH,e);break;ifiJGetTop(S^))p£intf(,,GetTqpErroriXn**);//判断GetTop是否合法,请填空dseprintffTheTopElementis%d!\nn,e);break;printf^TheLengdiof由eStadeis%d!\nM^St2ckLengdi^));//请填。break;St2ckTtaverse(S);〃请填空break;case0:return1;)(C++STLstack)#indude<maDoah>#indude<stdioh>#indude<stdEbh>#indude<stringh>#indude<stack>risingnamespacestd;intmainO(inta;stadc<int>S;intx;printff'AStackHasCreated.\n**);xdiile(l)(printff'lPush\n2^Pop\n3K3ettheTop\n4i<etumdieLengthofdieStack\n5JLoadAeStack\nO£xit\nPleasechoose:\n*);scanf(,,%dnJi&a);switch®(easel:scanff*%^',&x);S.push®;printffTheElement%disSuccessfullyPushed!\nH,x);break;if(S.en4>tyO)printffVqpErrori\n,');//再惭dseprintffThieElement%disSuccessfullyPcped!\nn,S.tr^O);S.popO;}break;郎.emptyO'printfCGetTopEnorf'tf)"/为惭GetT8是g裕法,请^^dseprintffTheTopElementis%d!\nH,S.topQ);break;printffTheLengthoftheStackis泡1\4期));〃请照break;case5://迷期角膜雌了郎.en^jtyO)printffTheStackisEmptylH);dse(inta[100Q]Ememset^,0^izeof(a));printffTheStackis:vdde(!S.einpty())(af++]=S.topO;S.popO;)forintj=(Xjvi;j++)j=i-l;j>=(^j-)S.push(aOP;printff'n");}break;caseQreturn1;)))8584翩啾列的基傅作时间限制ilOOOMS内存限制iIOOOK贩次物3772通过嬷1884»脸Desccption仓犍f空的癖两列米超队队出队、返回飒的长度、返回队头元素、婚!J的遍历融横法。#include<tnaloah>#indude<stdioJi>#defineOKl#defineERROROtypedefintStatus^/Status是球的翘淇值是函数结果蟋代码,如OK等typedefintQElernTyp^#defineMAXQSIZE100//最大队列您对Tt酬队列,最趣列长鳗减1)typedefstruct(QEkmlype^//初始化的魏汾配存储空间intftoni;//int^//麟针都列不空指向队列尾篇的下fS®}SqQueu^StatusInitQuaie^qQueue&Q(//构新T邺^JQ,哪冽预定义大小为MAXQSIZE〃谢I全代码}StatusEnQueue^qQueue&Q,QElemlypee){//插A元素e为Q的新的队尾元素//imt全代码}StatusDeQueue(SqQueue&Q,QElemType&e)(//蒯列不空则删除Q的队头族用e返回其值并返回OK;砌瞳1ERROR〃瀚隆代码}StatusGetHead(SqQueueQ,QElemlype&e){〃剖冽则用e返H队狗武,并醺OK,砌懈1ERROR〃制全代码intQueueLengdi(SqQueueQ)(〃胭微〃请补全代码}StatusQueueTravetse(SqQueueQ){//若秋列不空,贝!1M队头SIR尾依次输出各个队列甘,并返回OK;砌腿回ERRORintii=QAont;ifl: )prin.FQueueisEmptyf):〃请解else(printffTheQueueis");wMe( ) //i^^(printff^",);//i#^i= ;//i#^))printfTW;returnOK;inttnainOinta;SqQueueS;QElemlypex,if( )//判断顺猱是否6犍成功,请舷|ptintff'AQueueHasCreated\n");)vMe(l){printff*lEnter\n2Ddete\n3<JettheFront\n4RetumtheLengthoftheQueue\n5JjoadtheQueue\nOExit\nReasechoose:\n^;scanff1%dn,i&a);switch®(scanff1%dM,&x);ifl: )MntfTEnter //判断入队是否蹄,请填空elseprintffTheElement%disSuccessfullyEntered!\n",勾;break;if()printffDdeteEtrori\H);〃判断出队是否合法,请填空elseprintffTheElement%disSuccessfullyDdeted!\ii",e);break;jprintff'GetHeadErrorf\n,);〃判断GetHead是否合法,elseprintffTheHeadofdieQueueis%d!\nH,e);break;printffTheLengthoftheQueueis%d!\n". ):〃请填空break;case5://^&break;case0:return1;))MA•怫测试样例格式说明:根飕单操作:1、输入1,表蔻翻队队操作,紧跟番认要A队的元素2、输入2,表示要卖釉画操作3、输入3,4>以4,顾微5、输入5,表示从队头到队颗出队的所有元素6、输入0, 献2135250输出AQueueHasCreated.1Enter2dDdete3K3ettheFront4:RetumdieLengdioftheQueue51x)adtf>eQueuettExitReasechooseTheElement1isSuccessfullyEnteted!1EnterZDdete3X3ettheFront4iletumdieLengthoftheQueue5JLoaddieQueuettExitHeasechooseTheElement2isSuccessfullyEntered!l£nter2Ddete3<}ettheFront4:RetumtheLengthofdieQueue5ijoadtheQueuettExitHeasedioose:TheElement3isSuccessfullyEnteted!1Enter2JDdete3K3ettheFront4dRetiimdieLengthoftheQueue5Jjoad&eQueueftExitHeasechooseTheQueueis:1231Enter2iDdete3K3ettheFront4dRetumtheLengdioftheQueue51joaddieQueueftExitHeasedioosel£nter2JDdete3K3ettheFront4:RetumdieLengthofdieQueue5JLoadtheQueueftExitHeasediooseTheHeadoftheQueueis2!l£nter2Ddete3K3ettheFront4:RetumdieLengthoftheQueue5ix)adAeQueueftExitHeasechooseTheQueueis:231Enter2dDdete3K3ettheFront4:RetumdieLengdioftheQueue51x)adtf>eQueueftExitReasechoose悻yepn#indude<malloah>#indude<stdioh>#indude<stdlibh>#defineOKl#defineERROROtypedefintStatus;〃Status是函数的其值是函^结晶虎杰代码,如OK等typedefintQElemlyp^#defineMAXQSIZE100//#defineOVERFLOW-2typedefstructQElemType*base;//初始化的雌分配存储空间intfio明〃头指针部阴历空指向飒头元素intreax;//周&针省队列根指酗冽敢读的下T位1}SqQueu^StatusInitQueue(SqQueue&Q)(//构口个空队列Q,该队列预定双小为MAXQSIZE〃请#全代码Q.base二(QElemType*)malloc(MAXQSlZE*sizeof(QElemBpe));ifiJQ.base)exit(OVERF[jOW);Q£ont=Qieai=(XreturnOK;}StatusEnQueue(SqQueue&Q,QEkniIypee){//插A元素e为Q的新的队尾元素〃制全代码ifiJQjrear^Vi^MAXQSIZ^uQADnOfetumERROR;Q.base[Qieai]=^Qjiear=(QjearH)%MAXQSIZE;returnOK;)StatusDtQueue(SqQueue&Q>QElemType&e)//都列不空则删除Q的队头元素,用e返回其值并返回OK;否则;TERROR〃请II全代码if(Q丘ona=Qieai)retumERROR;e=Q.base[Q.fion^;Q^t=(Q.foMiH-l)%MAXQSIZE;returnOK;)StatusGetHead(SqQueueQ,QElemlype&e)(〃郡冽不空,则用e返回队头元素,并醺OK,否则返回ERROR补^代码if(Q丘onf二Qie*tetumERROR;e=Q.baseQfrong;returnOK;}intQueueLengdi^SqQiieueQ)(〃痼微〃潜隆代码return(Qiear-Q£ont+MAXQSIZE)%MAXQSIZE^)StatusQueueTraverse(SqQueueQ){//部冽不空,贝!IM队拈।以尾依孀出各件场玩素,并醺IOK;否则返0ERRORinti;i=QAon
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2025中核集团福清核电校园招聘笔试模拟试题及答案解析
- 2025吉林大学白求恩第一医院呼吸与危重症医学科录入员招聘1人笔试模拟试题及答案解析
- 学员申请表范表
- 被评为员工的感言
- 语文教材培训心得体会18篇
- 足球比赛观后感10篇
- 跑出一片天观后感集合15篇
- 几百几十加减几百几十综合考核习题大全附答案
- 超级领导力读后感(35篇)
- 货代销售培训
- 锁阳质量标准及规模化种植技术规程 第3部分:种子接种技术(DB15-T 2900.3-2023)
- 2024年度中国钠离子电池报告
- 人文社科书籍《中国在梁庄》
- 第12课 结交朋友-初识人工智能(教学设计)2023-2024学年第四册信息技术河大版(三起)
- 数学探究:用向量法研究三角形的性质教学设计-2023-2024学年高一下学期数学人教A版(2019)必修第二册
- RB/T 223-2023国产化检测仪器设备验证评价指南气相色谱仪
- DB3417-T 031-2024 学校食堂场所布局设置规范
- FANUC机器人培训教程(完成版)
- 奔驰车辆改装合同协议书
- 阳光心理-健康人生小学生心理健康主题班会课件
- 2024年全国职业院校技能大赛高职组(检验检疫技术赛项)考试题库(含答案)
评论
0/150
提交评论