蓝桥杯算法提高：逆序排列代码示例.pdfVIP

C++

#includeiostream

usingnamespacestd;

inta[25];

intmain()

{

inti=0,j,temp;

while(cintemp)

{

if(temp0)break;

a[i]temp;

i++;

}

if(i0)coutendl;

else

{

for(ji‑1;j0;j‑‑)

couta[j]

couta[0]endl;

}

return0;

}

C

#includestdio.h

#includestring.h

intmain(){inta[20],

i,j,t;for(i=0;i20;i++)

{scanf(%d,a[i]);

if(a[i]0){break;}}

for(j=0;ji/2;j++)

C++

#includeiostream

usingnamespacestd;

inta[25];

intmain()

{

inti=0,j,temp;

while(cintemp)

{

if(temp0)break;

a[i]=temp;

i++;

}

if(i0)coutendl;

else

{

for(j=i-1;j0;j--)

couta[j];

couta[0]endl;

}

return0;

}

C

#includestdio.h

#includestring.h

intmain()

{

inta[20],i,j,t;

for(i=0;i20;i++)

{scanf(%d,a[i]);

if(a[i]0)

{

break;

}

}

for(j=0;ji/2;j++)

{ta[i‑j‑1];a[i‑j‑1]

a[j];a[j]t;}for(j=0;ji;j

++){printf(%d,a[j]);

if(ji‑1)printf(\b);}

printf(\n);return0;}

JAVAimport

java.util.Scanner;

publicclassMain{publicstaticvoid

main(String[]args){Scannerscanner=

newScanner(System.in);inta[]=newint[21];

intn=0;for(inti=0;i21;i++){a[i]=

scanner.nextInt();if(a[i]0){break;}n++;}

for(intin‑1;i=0;i‑‑){System.out.print(a[i]+

);}}}