解：數(shù)據(jù)是對(duì)客觀事物的符號(hào)表示。在計(jì)算機(jī)科學(xué)中是指所有能輸入到解：抽象數(shù)據(jù)類(lèi)型包含一般數(shù)據(jù)類(lèi)型的概念，但含義比一般數(shù)據(jù)類(lèi)型更廣、更抽具體語(yǔ)言系統(tǒng)內(nèi)部定義，直接提供給編程者定義用戶數(shù)據(jù)，因此稱它們?yōu)轭A(yù)定義通常由編程者定義，包括定義它所使用的數(shù)據(jù)和在這些數(shù)據(jù)上所進(jìn)行的操作。在據(jù)部分和操作部分時(shí)，要求只定義到數(shù)據(jù)的邏輯結(jié)構(gòu)和操作說(shuō)明，不考慮數(shù)據(jù)的}count=log2n-2i=0n2n)+n5i=1n+1-1)i=1i=1{}f=0f=0fn=fn-1+fn-2+…+fn-k{}}}SumSumScore(SchoolNamesn,Co{if(a[i].sex==Female)t}}temp.TotalSum=temp.Male}1.19試編寫(xiě)算法，計(jì)算i!*2i的值并存入數(shù)組a[{}}elsecout<<a[i]<<"";}}i=0{cout<<"輸入多項(xiàng)式的階次n:";cout<<"Thepolynomailvalueis"<<polynomai}{}解：頭指針是指向鏈表中第一個(gè)結(jié)點(diǎn)的指針。首元結(jié)點(diǎn)是指鏈表中存儲(chǔ)第一個(gè)數(shù)點(diǎn)是在首元結(jié)點(diǎn)之前附設(shè)的一個(gè)結(jié)點(diǎn)，該結(jié)點(diǎn)不存儲(chǔ)數(shù)據(jù)解：當(dāng)線性表的數(shù)據(jù)元素在物理位置上是連續(xù)存儲(chǔ)的時(shí)候，用順序表比用鏈表好StatusDeleteK(SqLi{if(i<1||k<0||i+k>a.length)refor(j=a.length;j>=i+1;j--)a.elema.length--;}}StatusDeleteK(SqLi{if(i<0||i>a.length-1||k<0||k>}StatusInsertOrderList(SqList&va,Ele{//在非遞減的順序表va中插入元素x并使其仍成為順序表for(i=va.length;i>0,x<v}綴后的子表。若A’=B’=空表，則A=B；若A’=空表，而B(niǎo)’≠空表，或者兩者均不為空表，且A’的首元小于B’的首元，則A<B；否則A>B。試寫(xiě)一個(gè)比較A，B大小的算法。StatusCompareOrderList(SqList&{k=A.length>B.length?A.length:B.l}}{}}{}}voidMergeList_L(LinkList&ha,LinkList&hb,Lin{while(pa->next&&pb->nex}while(pb->next)pb=pb->ne}while(pa->next)pa=pa->ne}}{while(k<=len){q=q->next;}StatusDeleteAndInsertSub(LinkList&la{}}}}}}StatusListDelete_L(LinkList&L,ElemTypemink,E{while(p&&p->data<max}}}}voidListDelete_LSameNode(Li{}}}StatusListOppose_S{L.elem[i]=L.elem[L.le}}StatusListOppose_L({}}StatusListMerge_L(LinkList&A,LinkList&B,{}}StatusListMergeOppose_L(LinkList&A,LinkList&B,{}}}}}}StatusListCross_Sq(SqList&A,SqList&{while(i<A.length&&j<B.length){ListInsert_Sq(C,k,A}}}StatusListCross_L(LinkList&A,LinkList&B,{}}}}}}}StatusListCrossDelSame_Sq(SqList&A,SqList&{while(i<A.length&&j<B.length){ListInsert_Sq(C,k,A}ListInsert_Sq(C,k,A}}}}StatusListCrossDelSame_Sq(SqList&{while(i<A.length&&j<B.length){}}}}A.length=k;}StatusListCrossDelSame_L(LinkList&A,LinkList&B,{}}}}}}}}}StatusListCrossDelSame_L(LinkList&A,{}}}}}}}}}StatusListUnion_Sq(SqList&D,SqList&A,SqList&{}StatusListUnion_L(LinkList&A,LinkList&B,{}StatusListMinus_L(LinkList&A,{}}}}}}StatusListDelete_CL({}}StatusInitList_DL(Du{L=(DuLinkList)malloc(sizeof(}StatusListInsert_DL(DuLinkList&L,ElemTy{p=(DuLinkList)malloc(sizeof(D}StatusListCirToDu(Du{}}StatusListDivideInto3CL(LinkList&L,LinkList&s1,LinkList&s2,L{}}}}}StatusTraversingLinkList(XorLinkedList&L,ch{}}}}}//將雙向鏈表L=(a1,a2,...,an)改造為(a1,a3,.StatusListChange_DuL(Du{}}}DuLinkListListLocate_DuL(DuLinkList&L,ElemTypee){while(p!=L&&p->data!=e)while(q!=L&&q->freq>p->freq)q=q->ne}}}}0{L.data=(PolyTerm*)malloc(L.last*sizeof(P}}doublePolySum(SqPoly{}}StatusPolyMinus(SqPoly&L,SqPoly&L1{while(i<L1.last&&j<L2.last){}}p->coef=(p1->coef)-(p}}}while(i<L1.last){}while(j<L2.last){}}StatusPolyDifferential(Li{}p->data.coef=p->data.coef*p->datap->data.exp--;}}}StatusListDivideInto2CL(LinkedPoly&L,Lin{}}}}解：線性表是具有相同特性的數(shù)據(jù)元素的一個(gè)有限序列。棧是限定僅在表尾進(jìn)行輸出序列中不可能出現(xiàn)這樣的情形：存在著i<j<k使pj<pk<pi。解：這個(gè)問(wèn)題和3.1題比較相似。因?yàn)檩斎胄蛄惺菑男〉酱笈帕械?，所以若p<p<p，則可以理jki解為通過(guò)輸入序列pjpjpkpi可以得到輸出序列pipjk3.1題。所以不可能存在著i<j<k使pj<pk<pi。#######AAIIK123456789cout<<i--;{}}{{}}{while(!StackEmpty(s}}{{}}{{}{}{}{}}}{if(top[1]>top[0])return*top[1]--;}}{}{while(s.top){s.size--;}}{while(s.top){s.size--;}}{}{}StatusGetTop(Stacks,{}}StatusPush(Stack&s,ElemTy{}StatusPop(Stack&s,{s.size--;}}//從棧頂?shù)綏５子肰isit()函數(shù)遍歷棧{}while(p)Visit(p->dat{cout<<"請(qǐng)輸入硬席(H)和軟席車(chē)廂(S)序列：";}}}}BOOLSymmetry(chara{while(a[i]!='&'&&a[i]){}}}}BOOLBracketCorrespondency(chara{}}}3.20假設(shè)以二維數(shù)組g(1…m,1…n)表示一個(gè)圖像區(qū)域，g[i,j]表示該區(qū)域中點(diǎn)(i,j)所具顏色，其值為voidCreateGDS(ElemTypevoidShowGraphArray(ElemTypevoidRegionFilling(ElemTypeg[M][N],PosTypeCurPos,int{RegionFilling(g,StartPos,F}voidRegionFilling(ElemTypeg[M][N],PosTypeCurPos,int{Push(s,g[CurPos.x][CurPoswhile(!StackEmpty(sg[CurPos.x][CurPos.y].g[CurPos.x+1][CurPos.y])Push(s,g[CurPos.x+1][CurPosg[CurPos.x-1][CurPos.y])Push(s,g[CurPos.x-1][CurPosg[CurPos.x][CurPos.y+1])Push(s,g[CurPos.x][CurPos.g[CurPos.x][CurPos.y-1])Push(s,g[CurPos.x][CurPo}}voidCreateGDS(ElemType{}}voidShowGraphArray(ElemType{}}voidInversePolandExpression(char{while(Buffer[i]!='#}}}}}while(!StackEmpty(s}}{}}{if(j==2)j--;if(j==4)j--;}charCalVal_InverPola{while(Buffer[i]!='#}}}}{}}#include"d:\VC99\DSStatusPush(Stack&s,ElemTStatusPop(Stack&s,ElemT{cout<<"請(qǐng)輸入逆波蘭算術(shù)表達(dá)式字符序列：";}{}}}}}}}}{}StatusPush(Stack&s,ElemTy{}StatusPop(Stack&s,ElemTy{}s.size--;}{}{}}{}{}303132338344052{}}doubleSqrt(doubleA,double{}doubleSqrt(doubleA,doublep,{}{}}{e.nval--;}}e.mval--;}}021620411610401021620411610akm=akm(m-1,1)=akm(0,021620411g=akm(m,n-1)=akm(1,0)=2;akm=akm702021620411g=akm(m,n-1)=akm(1,0)=2;akm=akm(m-1,g)=akm(0,021620akm=akm(m-1,1)=akm(1,021613612611610401021613612611610021613612611702021613612611021613612703021613612g=akm(1,1)=3;akm(m-1,g)=akm(0,3)=4613704021613021），{}StatusEnQueue(Queue&q,ElemTy{}}}StatusDeQueue(Queue&q,ElemTyp{}}q.size--;}{}StatusEnQueue(Queue&q,ElemTy{}}StatusDeQueue(Queue&q,ElemTyp{}}{}StatusEnQueue(Queue&q,ElemTy{if((q.rear+1)%MaxQSize==(q.rea}}StatusDeQueue(Queue&q,ElemTyp{e=q.base[(q.rear+MaxQSize-qq.length--;}}StatusSymmetryString{}while(!StackEmpty(s}}{}}}}returnq.base[(q.rear+q.MaxSize-1)%q}{}StatusEnDQueue(DQueue&q,ElemTy{if(q.front==q.rear&&}if(e<(q.base[q.front]+q.base[(q.reaq.front=(q.front+q.MaxSiz}}}}StatusDeDQueue(DQueue&q,ElemTyp{}}//Filename:XT333.cpp主{while(dq.front!=dq.rear||dq.tag){}}{cout<<"請(qǐng)輸入待調(diào)度的車(chē)廂字符序列if(ch[i]=='S')EnDQueueif(ch[i]=='H')EnDQueue}while(dq.front!=dq.rear||dq.tag){}}Concat(t,SubString(s3,1,5),SubStrinString::String(constSt{}{}{}{}voidString::StrAssign(String{}{}{}voidString::Concat(String{}{}}{}{}j≤1){}{}{}{}{}{}voidRRMove(ElemTypeA[],intk{}}}voidInitialize(NodeTypea[RS][CS],ElemTypevoidSaddlePoint(NodeTypeaElemTypeRowMin(NodeTypea[RS][CS],iElemTypeColMax(NodeTypea[RS][CS],ivoidShow(NodeTypea{}voidInitialize(NodeTypea[RS][CS],ElemType{}}}voidSaddlePoint(NodeType{}}}ElemTypeRowMin(NodeTypea[RS][CS],i{}}ElemTypeColMax(NodeTypea[RS][CS],i{}}voidShow(NodeType{}BOOLoperator<(TripleBOOLoperator==(TripleBOOLTriple::operator<(Triple{}BOOLTriple::operator==(Triple{}{CSparseMatoperator+(CSpars{m_pt=newTriple[m_nm_pt[i].row=dlg1.m_m_pt[i].col=dlg1.m_}}}voidCSparseMat::ShowSparse({}pDC->TextOut(0+j*20,0+i*20,str,strl}}}CSparseMatCSparseMat::operator+(CSpar{CSparseMattemp(m_nRow,temp.m_pt=newTriplwhile(i<m_nTrs&&j<B.m_nTr}temp.m_pt[k].e=m_pt[i].e+B.}}}}}}}{Twin*m_pt;//指向非零元的指針{cout<<"請(qǐng)輸入非零元二元組的列標(biāo)和值：";cin>>m_pt[i].col>>m}cout<<"請(qǐng)輸入每行第一個(gè)非零元在二元組中的序號(hào)}}{}}}}}}}{}{OLink*RHead,*CHead;CCrossListMat(intr,intc,{}while(q&&q->col<p->co}}OLink*RHead,*CHead;}while(q&&q->row<p->ro}}}}{}{CCrossListMat(intr,intc,{}while(q&&q->col<p->co}}}while(q&&q->row<p->ro}}}}voidCCrossListMat::Add(CCrossL{while(pa&&pa->col<pb->co}}}}}}}}}{}cout<<0<<"";}}}{CCrossListMatA(3,3,4)}AtomTypeatom;intStrDistrict(CString&St{elseif(!s1.StrCompare(s4))k--;}HStr=Str.SubString(1TStr=Str.SubString(}}}{CStringSub,HSub,TSub;Sub=s.SubString(2,s.StrLeng}}}}}}{}}}}{HDepth=Depth+GListDepth(LTDepth=Depth+GListDeptreturnHDepth>TDepth?HDep}}{}}}StatusGListCompare(GList&L1,{}GListCompare(L1->tp}}}}解：根據(jù)樹(shù)的定義，在一顆樹(shù)中，除樹(shù)根結(jié)點(diǎn)外，每個(gè)結(jié)點(diǎn)有且僅有一個(gè)前驅(qū)結(jié)結(jié)點(diǎn)與指向它的一個(gè)分支一一對(duì)應(yīng)，所以除樹(shù)根結(jié)點(diǎn)之外的結(jié)點(diǎn)樹(shù)等于所i=10ii=1(l21)(lp1)pp(l21)(lp11)(l21)(lp1)空間，則當(dāng)mk<n(k+12)時(shí)，即時(shí)，采用順序存儲(chǔ)比采用三叉A0203B0405C0616D1215E0708F1309G00H113I01J01K10L1910M11N118while(!r->ltag)r=r->lchiGFKDAIEBCHJ為所求二叉樹(shù)的先序序列，DIAEKFCJHBG為二叉樹(shù)的中序序列。通過(guò)觀察先序序列，GG(F(K(DIAE,NULL),B(CJH,NULL)G(F(K(D(NULL,IAE),NULL),B(C(NULL,JH),NULL)G(F(K(D(NULL,A(I,E)),NULL),B(C(NULL,H(J,NULL)),NULL)樹(shù)樹(shù)A:1101B:01C:11111D:1110E:10F:11110G:00H:{}}}}}}{}}}}}}{}charT[N]={'0','a','b','c',{cout<<"請(qǐng)輸入結(jié)點(diǎn)的值：";}{}}{}{}StatusSimilarTree(BiTree&T1,{}&&SimilarTree(T1->rchild,T2->rch}}}{while(p||!StackEmpty(s}}StatusPONodeK(TElemType{}}}StatusPOLeafNodeNum(int&i,B{POLeafNodeNum(i,T->POLeafNodeNum(i,T->}}StatusExchangeBiTree(B{}}StatusChildTreeDepth(BiTree&T,TElemTypex,i{}}StatusPreOrderLocate(BiTree&T,TElemType{}}}}}{}}StatusDelChildTree(BiTree&T,TEle{}}}}}{}}StatusCopyBiTree(BiTree&T,{CopyBiTree(T->lchild,T1CopyBiTree(T->rchild,T1}}}#include"c:\Yin\inclu{while(!QueueEmpty(q}}StatusMinComAncst(BiTree&T,TElemType&e,TElemType*p,TEl{while(T1&&T2&&T1->data==T2->dat}}}}}}StatusPathTree(BiTree&T,TEl{}}}}}StatusCompleteBiTree(B{d=BiTDepth(T->lchild)-BiTCompleteBiTree(T->rchild))ret}}}StatusShowBiTExpress(B{}}}}}}{}{InitStack(s1);InitStack(}while(!StackEmpty(s1}}while(!StackEmpty(s2}}}}}StatusMaxPathBiTree(B{MaxPathBiTree(T->lchiMaxPathBiTree(T->rchi}}StatusLMaxPathBiTree(B{}}}}StatusCreateCompleteBiTree(SqList<TElemType>&ST,B{while(!QueueEmpty(q)&&i<len-p->lchild->data=ST.}p->rchild->data=ST.}}}StatusPreOrderTraverse(B{PreOrderTraverse(T->PreOrderTraverse(T->}}{}