ST數(shù)據(jù)結(jié)構(gòu)作業(yè)與實(shí)驗(yàn)參考答案（一）自然科學(xué)

1351925

//9004ANSWER

#includeusingnamespacestd;intmain{intn,s,t,len,A[21],i,s_i,t_i,j,span;cin>>n;while(n--){cin>>s>>t>>len;for(i=0;i>A[i];if(s>=t||len20){couttif(s_iusingnamespacestd;intmain{intn,i,j,A[11112],B[11112];while(cin>>n){if(n>=1i>A[i];for(i=0;iusingnamespacestd;

structNode{intdata;Node*next;};intmain{inti,n,data[100],min;Node*first,*p,*q,*s,*tail;while(cin>>n){if(n==0){cout>data[i];first=newNode;first->next=NULL;tail=first;for(i=0;idata=data[i];tail->next=s;tail=s;}tail->next=NULL;p=first;min=first->next->data;while(p->next){q=p;p=p->next;if(p->datadata;}p=first->next;q=first;while(p){if(p->data==min)break;else{q=p;p=p->next;}}if(pdeletep;cout0）；其次行為單鏈表的各元素。Output

輸出該單鏈表中倒數(shù)第k個(gè)結(jié)點(diǎn)的值。若該結(jié)點(diǎn)不存在，則輸出“notfind”。SampleInput51

1234555

12345SampleOutput51

//9016ANSWER

#includeusingnamespacestd;

structNode{intdate;Node*next;};intmain{intn,k,i,c,data[100];Node*first,*r,*p,*s;while(cin>>n>>k){for(i=0;i>data[i];first=newNode;r=first;for(i=0;idate=data[i];r->next=s;r=s;}r->next=NULL;}

9017:統(tǒng)計(jì)選票

ProblemDescription

設(shè)有m個(gè)候選人n張選票，每張選票選且只選一人，候選人編號(hào)依次為1，2，3，...，m?，F(xiàn)將這n張選票存于一單鏈表中，要求統(tǒng)計(jì)并輸出每個(gè)候選人的得票結(jié)果。

//倒數(shù)第k個(gè)就是正數(shù)第n-k+1個(gè)。if(k0，0usingnamespacestd;intmain{intvotes[100],n,i,m,c;while(cin>>m>>n){for(i=1;i>c;votes[c]++;}for(i=1;iusingnamespacestd;intmain{inti,j,c,l,n,m,A[101],Queue[101],front,rear;while(cin>>n>>m){for(i=0;i>A[i];front=rear=0;c=0;l=0;for(i=0;iusingnamespacestd;intmax(intA,intn){if(n==1)returnA[0];else{if(A[n-1]>=max(A,n-1))returnA[n-1];elsereturnmax(A,n-1);}}

intmain{inti,n,A[101];while(cin>>n){for(i=0;i>A[i];cout#include

usingnamespacestd;intmain{intn,k,carNum[11],i,j,rearrange;while(cin>>n>>k){for(i=0;i>carNum[i];queueQ[5];rearrange=1;for(i=0;iQ[j].back){Q[j].push(carNum[i]);break;}}if(j==k){rearrange=0;break;}}coutusingnamespacestd;

intmain{inti,len,flag;charstr[100],stack[100],top=-1;while(cin>>str){len=strlen(str);flag=0;top=-1;for(i=0;iusingnamespacestd;intmain{intn,i,flag;charstr[51],stack[51],top=-1;while(cin>>str)

{n=strlen(str);top=-1;flag=0;for(i=0;i-1)top--;else{coutusingnamespacestd;intmain{

intn,i,j,in,out;//in輸入序列指針，out輸出序列指針intoutput[51],stack[51],top=-1;while(cin>>n){for(i=0;i>output[i];

}

top=-1;in=0;for(i=0;iin){for(j=in+1;jusingnamespacestd;intmain{

intn,i,j,flag,maxi;doublemax;//max肯定是double類型while(cin>>n){if(n>pw