華南農(nóng)業(yè)大學(xué)數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)答案包含STL版_第1頁(yè)
華南農(nóng)業(yè)大學(xué)數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)答案包含STL版_第2頁(yè)
華南農(nóng)業(yè)大學(xué)數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)答案包含STL版_第3頁(yè)
華南農(nóng)業(yè)大學(xué)數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)答案包含STL版_第4頁(yè)
華南農(nóng)業(yè)大學(xué)數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)答案包含STL版_第5頁(yè)
已閱讀5頁(yè),還剩120頁(yè)未讀 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說(shuō)明:本文檔由用戶(hù)提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

8576JI財(cái)線性表的基械作時(shí)間限制:1000MS內(nèi)存限制:1000K想帶數(shù)9027通過(guò)雌2456?輜題語(yǔ)言無(wú)限制Description編寫(xiě)算法,創(chuàng)建初始化容量為USTJNHLSIZE的順牘T,并實(shí)嫄入、刪除、遍歷操作。本題目給出部分代碼,謝隆:內(nèi)容。#ttxiude<stdioh>#indude<manoah>#defineOKl#defineERROR0#defineUSTLINrrjSIZE100#defineLISTINCREMENT10#defineEhmTypeinttypedefstruct(int*elem;intlength;intlistsize;JSqList;intInitLiscSq(SqList&L)(//雌23,樹(shù)心寸翎幽牌L, 卜為USIJNIILSIZE〃武隆代碼imLoadjSq^qList&L)//輸出J惻祿所有標(biāo)inti;一 )printfClLeListis?iytyT)://請(qǐng)鰥eke|printffUieLjstis:");for( )printfC%d", );//請(qǐng)?bào)皚printff'n');returnOK;)intLisdnsert_Sq(SqIjst&Ljntijnte){//算法24,在順序轆表L中第i個(gè)位置之前插A新的元素e//i 1<i<Uength+1〃耐全代碼intListDdet^_Sq(SqList&Ljnti,int&e)//算法25在初硬性表L中刪除第i個(gè)位置的元素,并用e返回其值〃^^險(xiǎn)代碼intmainO{SqListT;Elemlypee,x;if( )//判斷順鏈?zhǔn)欠駝?chuàng)建成功{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;})的做測(cè)試樣例格式說(shuō)明:根轆單操作:1、輸入1,表示要實(shí)現(xiàn)腳斕作,緊跟著要輸入插入的位野玩素,用空格分開(kāi)2、^A2,表示要賣(mài)現(xiàn)刪I娥作,緊跟著蟋入刪除的位置3、輸入3,表示要輸出順祿的所有元素朱^A0,表示程序結(jié)束輸入樣例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惻祿所有標(biāo)inti;ifjjJengWRpHntfnheListisempty!)//請(qǐng)鰥eke|printffTheListis:');ftM^=^<IJengthi++)printff1%dMJ^elem0);//請(qǐng)?zhí)羁諁printff'n');returnOK;)intLisdnsert_Sq(SqIjst&Ljntijnte){//算法24,在順鎖域L中第i個(gè)位置之前插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個(gè)位置的元素,并用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)) //判斷順;猱是否創(chuàng)建成功{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值是否合法,請(qǐng)^^elseprintffTheElement%disSuccessfullyInserted!\n",為;break;scanff*%d”聞;ifiJIlstDeletjSqF^MnKDeleteEnoNf)"/判斷i值是否合法,請(qǐng)鰥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產(chǎn)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)詢(xún)==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值是否觸,請(qǐng)?zhí)羁誨se{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%!”項(xiàng);)printff'n,);break;caseChreturn1;}8577合并J廁株時(shí)間限制:1000MS內(nèi)存限制:1000K版次數(shù)5339通過(guò)雌2251?輜題語(yǔ)言無(wú)限制Description編寫(xiě)算法,將兩個(gè)非遞減有序順眼A和B合并成一 腱減有序順裱C。本撕流供代碼,請(qǐng)同學(xué)ff馳立完成,所需子遨爆考前面完峭內(nèi)容。缺福第* A的甘微第二行:順?biāo)睞的各元素G助減),用空格分開(kāi)行:順I(yè)裱B斷素微第H行:順的鮑熊(斗睡減),用空能班輸?shù)妮Y第一行:順I(yè)裱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=國(guó)LJengdi=n;for^=ai<LJength;i++)scanff*%d,,^8ikelemgl);returnOK;}intLoadjSq(SqList&L)(inti;iflJJengdEJtetuma〃請(qǐng)鰥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;〃請(qǐng)鰥elseprintfW現(xiàn);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裱逆置時(shí)間限制ilOOOMS內(nèi)存限制iIOOOK販次物3660通過(guò)嬤2149?臉Desccption設(shè)有TlE?A=(aOR-(皿1),嬲W^^OjANan-liaUaLaq)。麟,將逆置,要求順猱仍占用原刷祿的空間。本題襁供代碼,請(qǐng)同學(xué)4郎完成,所需子函修考前面完成的內(nèi)容。第F輸A順祿的元素個(gè)數(shù)第二行:輸A順糅的各元素,用空格分開(kāi)輸時(shí)髏第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,構(gòu)igT空搦捌L, 領(lǐng)艇以小為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)(領(lǐng)二①<口您++)(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項(xiàng)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"!"現(xiàn);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的線性表的基械作時(shí)間限制1OOOMS內(nèi)存限制:1OOOK甄逸:5567遹此數(shù)2176蝌雌,倉(cāng)有緘L并^?A、倘、蜥搦乍。椿目跚部然碣常陛內(nèi)容。#inchide<stdioJi>#indude<malloah>#defineERRORO#defineOKl#defineEJernTypeinttypedefstructLNode{intdata;structLNode*next;}LNodj*UnkList;intCreateIjnlHL(LinkList&L^int坨{//犍含有n個(gè)元素的單緘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財(cái)ode)); 點(diǎn)〃請(qǐng)補(bǔ)全代碼}tetumOK;}intLoadLinKJL/LinkList&L){〃單LinkListp=L->next;皿 )printfCIheListisempty!')://請(qǐng)鰥dse{printffTheLinkLstis:');wbfle() //(printff*%dMjp->data); //^&})printff'Xn");returnOK;)intLinldnsertJ(LinkList i^emlypee){〃算法29//雌珀睜〃滯隆代碼intLinkDelet^JL/LinkList&L^inti,EkmType&e){//算法210〃在給給點(diǎn)的單雌牌L中,刪除第i個(gè)元素,并用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;)|)測(cè)試樣例黜:說(shuō)明:根解單操作:1、輸入1,表示要實(shí)嫄入操作,緊S般輸入插入的位置和標(biāo),用空格分開(kāi)2、輸入2,表示要翻刪娥作,緊跟鞋輸入刪除的位置3、輸入3,表示要輸出順洋的所有標(biāo)4、輸入0,表礴序結(jié)束觸的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){//創(chuàng)建含有n個(gè)蔗的單僦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));//生成新結(jié)點(diǎn)p->dala=^p->next=q->next;q->next=p;q=p}returnOK;intLoadLinUXUnkList{〃單LinkListp=L->next;g=NULDprimfnheListisen^ty!');〃請(qǐng)?zhí)?。dse{printffTheLinkListis:');wbile(p!=NULQ//printff*%dMp->data);p=p->next;//請(qǐng)霹})printff'n');returnOK;)intLinldnsenJ/LinkListfid-5inti^lemlypee){〃算法29//螂珀睜〃請(qǐng)#全代碼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〃在黔啰點(diǎn)的單麒性表L中,刪除第i個(gè)稼,并用e返回其值〃請(qǐng)#全代碼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)) //判斷球是酬建成功,請(qǐng)鰥{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值是否能,請(qǐng)舞elseprintffTlieElement%disSuccessfullyInsertEd!\nH,項(xiàng)break;scanff*%d”聞;ifiJLinkDeleteJL(rie))printfCDeleteEnorfH);〃判斷i值是否合法,請(qǐng)鰥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{時(shí)=1Q前l(fā)ist<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){詢(xún)=習(xí){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值是否觸,請(qǐng)?zhí)羁誨se{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時(shí)間限制:1000MS內(nèi)存限制:1000K版次數(shù)3724通過(guò)緘fc2077?輜題語(yǔ)言無(wú)限制Description設(shè)I#法將兩眼降減有序球A和B合并成一 腱減有序球Co本題襁供代碼,請(qǐng)同學(xué)他蚊完成,所需子觥參考之前完成的內(nèi)容。缺福第F:?jiǎn)钨諥的甘微第二行:?jiǎn)捂湵鞟的各元素俳遞減),用空格分開(kāi)行:的元素個(gè)數(shù)第H行:?jiǎn)吻駼的酶熊(斗睡減),用空能班輸?shù)妮Y第一行:?jiǎn)钨諥的旗列表蛆行:?jiǎn)吻蚱D第三行:合并后單球C的元素列表私懶6122445628496415317586輸出ListM22445628496ListB:15317586ListG12152431456275848696悻ytynm-:(om)#indude<stdioh>#indude<mallcxdi>#defineERROR0//defineOKI#defineEkmlypeinttypedefstructLNode(intdata;structLNode*next;}LNode,*LinkList;intCreateLinkJ/^kList&Untn){//創(chuàng)建含有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));// 點(diǎn)p->data=^p->next=q->next;q=preturnOK;intLoadUnkJ/LinkList&L){〃單LinkListp=L->next;ifi^=NULE)printff'TheListisempty!");//請(qǐng)?zhí)羁誽dde(p!=NUIJJ)//1#^(printf("%d"p->data);p=p->nest;//請(qǐng)^空})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線時(shí)間限制:1000MS內(nèi)存限制dOOOK提交次數(shù)2811通過(guò)次數(shù)2032醒:雌題語(yǔ)言無(wú)限制Description設(shè)有(30凡_>(皿1), A'=(an-V,a^al,a0),逆置,要雌性表仍占用殿性賽<J空間。本題襁供代碼,請(qǐng)同學(xué)假霞立完成,所需子微—之前完成的內(nèi)容。第f的n,標(biāo)單緘幀素個(gè)數(shù)第二行:輸入單夠的頡素,用空格分開(kāi)輸出I物;第一行:輸出單緘逆置前的元素列表第二行:輸出單麋逆置后的元素列表輸入樣例3297546535846175輸出樣例Thelistis3297546535846175TheturnedListis:7561843565549732候#indude<stdioh>#indude<maloah>#defineERROR0//defineOKI#defineEhmIypeinttypedefstructLNode(intdata;structLNode*next;}LNode,*LinkList;intCreateLinkJ/LinkList&Ijntn){//創(chuàng)建含有n傷素的單觸LinkListp知inti;Elemlypee;L=(LinkIisi)maDoc(sizeof(LNod^));L>next=NULL;//先建立熠點(diǎn)球q=(LinkLis^maDoc(sizeof(LNod^));q=LforG=(XiVn;i++){scanff,%dM,&e);p=(LinkDst)manoc(sizeof(LNode));// 點(diǎn)p->data=^p->next=q->next;q->next=p;q=p)returnOK;)intLoadLinkJ/LinkList&p{〃單LinkListp=Lr>next;ifiJp==NULQprintffTheListisen^tyT);〃請(qǐng)dse(wMe(p!=NULp//{printf<"%d"p->dala);p=p->nest;//請(qǐng)})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順?shù)侖捊饷σ粯咏夥℉:徵組)和8578順糅逆I解法H一樣8583順序班基械作時(shí)間PgMlOOOMS內(nèi)存蝌:1000K販次庭4189通過(guò)嬤2059整臉Descrption創(chuàng)建f空的順序棧,并翅柵)入棧、出棧、返回鄙脹度、返回棧頂元素、懶I遍歷建隨法。WTWW補(bǔ)#inchide<mallocji>#indude<stdioh>#defineOKl#defineERRORO#defineSTACK_INIT_SIZE100//存端蒯始邠遑#defineSTACKINCREMENT10//存儲(chǔ)空間分配增量typedefintSEkmType;//定義棧元彩性typedefintStatus;//Status 如OK等structSqStadc{SEkmType*base;// baseNULLSElemType*tcp;//WWW-intstacksiz^//當(dāng)前已分配的存儲(chǔ)型間,以元素為單位);//3娛StatusInitStack(S<jStack&S)//構(gòu)苣棧S,該頻定義大小為STAGKJNTILSIZE〃請(qǐng)#全代碼StatusPush(SqStack&S3ElemIypee)//碘s〃翱全代碼StatusPop(SqSt2ck&S,SElemIype&e)〃若胡空,貝刪除s的棧頂元素,用e返回其值,并返回OK;否則返回ERROR補(bǔ)^代碼}StatusGeffqXSqStackS3EkmType&e){〃若窗空,則用0顧56?^,fflHlOK;砌崛ERROR//imt全代碼)intStackLengfh(SqStackS)〃返回棧S的元素儲(chǔ)〃請(qǐng)#全代碼//從棧陲胺底依次鼬的蹣打蔑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是否雒,請(qǐng)鰥dseprintffTheElement%disSuccessfullyPushed!\nM,x);break;caseZifi;)printfi^PopEngn〉;〃判斷Pop是否合法,請(qǐng)dseprintf^TheEkment%disSuccessfullyPcped!\nM,e);break;if( )printff'GetTopErtorf'H);〃判斷GetTop是否合法,請(qǐng)?zhí)羁誨seprintffTheTopElementis%d!\nH,e);break;printff*TheLengdiofAeStackis%d!\nM,);//空break;//i#^break;case0:return1;測(cè)試樣例格式說(shuō)明:根僦單操作:1、輸入1,表示要翊Push操作,緊跟著輸入要Push的元素2、輸入2,表示要題Pop操作3、^A3,返0棧甌素4、^A4,返0棧的元g個(gè)數(shù)5、輸入5,表示從棧頂?shù)絎獺出榭<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//存儲(chǔ)空間分配增量#defineOVERFLOW-1typedefintSElemType;//定義棧元素typedefintStatus;"Status是函數(shù)的翹淇值是函數(shù)結(jié)果狀態(tài)代碼,如OK等structSqStack(SElemType*base;// baseNULLSElemType*tip;//WW&tfintstacksize;//當(dāng)前已分配的存儲(chǔ)空間,以元素為單位};//StatusInitStackf&jStack&S)(//構(gòu)新空棧S,該椀娓沒(méi)小為STACKUNTILSIZE〃請(qǐng)#全代碼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的元素個(gè)數(shù)〃請(qǐng)I陛代碼returnS.tt4>S.base;}StatusStackTraverse^StackS)(U從棧颼胺底依次鼬的瞬1日SElemType*p=(SElemlype*)malloc(si2eofjJSElemTyp^));p=Stopifi^.base==S.top)pflntffTheStackisEmptyf);〃請(qǐng)第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是否合法,請(qǐng)dseprintffTheElement%disSuccessfullyPushed!\nn,勾;break;ifiJPcp(S^))printfV'PopEnoriXn**);//判斷的是否合法,請(qǐng)dseprintffTheElement%disSixxessfiillyPoped!\nH,e);break;ifiJGetTop(S^))p£intf(,,GetTqpErroriXn**);//判斷GetTop是否合法,請(qǐng)?zhí)羁誨seprintffTheTopElementis%d!\nn,e);break;printf^TheLengdiof由eStadeis%d!\nM^St2ckLengdi^));//請(qǐng)?zhí)睢reak;St2ckTtaverse(S);〃請(qǐng)?zhí)羁誦reak;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裕法,請(qǐng)^^dseprintffTheTopElementis%d!\nH,S.topQ);break;printffTheLengthoftheStackis泡1\4期));〃請(qǐng)照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翩啾列的基傅作時(shí)間限制ilOOOMS內(nèi)存限制iIOOOK販次物3772通過(guò)嬤1884?臉Desccption倉(cāng)犍f空的癖兩列米超隊(duì)隊(duì)出隊(duì)、返回颯的長(zhǎng)度、返回隊(duì)頭元素、婚!J的遍歷融橫法。#include<tnaloah>#indude<stdioJi>#defineOKl#defineERROROtypedefintStatus^/Status是球的翹淇值是函數(shù)結(jié)果蟋代碼,如OK等typedefintQElernTyp^#defineMAXQSIZE100//最大隊(duì)列您對(duì)Tt酬隊(duì)列,最趣列長(zhǎng)鰻減1)typedefstruct(QEkmlype^//初始化的魏汾配存儲(chǔ)空間intftoni;//int^//麟針都列不空指向隊(duì)列尾篇的下fS?}SqQueu^StatusInitQuaie^qQueue&Q(//構(gòu)新T鄴^JQ,哪冽預(yù)定義大小為MAXQSIZE〃謝I全代碼}StatusEnQueue^qQueue&Q,QElemlypee){//插A元素e為Q的新的隊(duì)尾元素//imt全代碼}StatusDeQueue(SqQueue&Q,QElemType&e)(//蒯列不空則刪除Q的隊(duì)頭族用e返回其值并返回OK;砌瞳1ERROR〃瀚隆代碼}StatusGetHead(SqQueueQ,QElemlype&e){〃剖冽則用e返H隊(duì)狗武,并醺OK,砌懈1ERROR〃制全代碼intQueueLengdi(SqQueueQ)(〃胭微〃請(qǐng)補(bǔ)全代碼}StatusQueueTravetse(SqQueueQ){//若秋列不空,貝!1M隊(duì)頭SIR尾依次輸出各個(gè)隊(duì)列甘,并返回OK;砌腿回ERRORintii=QAont;ifl: )prin.FQueueisEmptyf):〃請(qǐng)解else(printffTheQueueis");wMe( ) //i^^(printff^",);//i#^i= ;//i#^))printfTW;returnOK;inttnainOinta;SqQueueS;QElemlypex,if( )//判斷順猱是否6犍成功,請(qǐng)舷|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 //判斷入隊(duì)是否蹄,請(qǐng)?zhí)羁誩lseprintffTheElement%disSuccessfullyEntered!\n",勾;break;if()printffDdeteEtrori\H);〃判斷出隊(duì)是否合法,請(qǐng)?zhí)羁誩lseprintffTheElement%disSuccessfullyDdeted!\ii",e);break;jprintff'GetHeadErrorf\n,);〃判斷GetHead是否合法,elseprintffTheHeadofdieQueueis%d!\nH,e);break;printffTheLengthoftheQueueis%d!\n". ):〃請(qǐng)?zhí)羁誦reak;case5://^&break;case0:return1;))MA?怫測(cè)試樣例格式說(shuō)明:根颼單操作:1、輸入1,表蔻翻隊(duì)隊(duì)操作,緊跟番認(rèn)要A隊(duì)的元素2、輸入2,表示要賣(mài)釉畫(huà)操作3、輸入3,4>以4,顧微5、輸入5,表示從隊(duì)頭到隊(duì)顆出隊(duì)的所有元素6、輸入0, 獻(xiàn)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是函數(shù)的其值是函^結(jié)晶虎杰代碼,如OK等typedefintQElemlyp^#defineMAXQSIZE100//#defineOVERFLOW-2typedefstructQElemType*base;//初始化的雌分配存儲(chǔ)空間intfio明〃頭指針部陰歷空指向颯頭元素intreax;//周&針省隊(duì)列根指酗冽敢讀的下T位1}SqQueu^StatusInitQueue(SqQueue&Q)(//構(gòu)口個(gè)空隊(duì)列Q,該隊(duì)列預(yù)定雙小為MAXQSIZE〃請(qǐng)#全代碼Q.base二(QElemType*)malloc(MAXQSlZE*sizeof(QElemBpe));ifiJQ.base)exit(OVERF[jOW);Q£ont=Qieai=(XreturnOK;}StatusEnQueue(SqQueue&Q,QEkniIypee){//插A元素e為Q的新的隊(duì)尾元素〃制全代碼ifiJQjrear^Vi^MAXQSIZ^uQADnOfetumERROR;Q.base[Qieai]=^Qjiear=(QjearH)%MAXQSIZE;returnOK;)StatusDtQueue(SqQueue&Q>QElemType&e)//都列不空則刪除Q的隊(duì)頭元素,用e返回其值并返回OK;否則;TERROR〃請(qǐng)II全代碼if(Q丘ona=Qieai)retumERROR;e=Q.base[Q.fion^;Q^t=(Q.foMiH-l)%MAXQSIZE;returnOK;)StatusGetHead(SqQueueQ,QElemlype&e)(〃郡冽不空,則用e返回隊(duì)頭元素,并醺OK,否則返回ERROR補(bǔ)^代碼if(Q丘onf二Qie*tetumERROR;e=Q.baseQfrong;returnOK;}intQueueLengdi^SqQiieueQ)(〃痼微〃潛隆代碼return(Qiear-Q£ont+MAXQSIZE)%MAXQSIZE^)StatusQueueTraverse(SqQueueQ){//部冽不空,貝!IM隊(duì)拈?以尾依孀出各件場(chǎng)玩素,并醺IOK;否則返0ERRORinti;i=QAon

溫馨提示

  • 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶(hù)所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶(hù)上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶(hù)上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶(hù)因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

最新文檔

評(píng)論

0/150

提交評(píng)論