题目描述
You are given a sequence of integer numbers. Zero-complexity transposition of the sequence is the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence.
输入描述:
For each case, the first line of the input file contains one integer n-length of the sequence (0 < n ≤ 10 000). The second line contains n integers numbers-a1, a2, …, an (-1 000 000 000 000 000 ≤ ai ≤ 1 000 000 000 000 000).
输出描述:
For each case, on the first line of the output file print the sequence in the reverse order.
示例1
输入
复制
5
-3 4 6 -8 9
输出
复制
9 -8 6 4 -3
import java.util.*;import java.io.*;import java.text.* ;publicclassMain{publicstaticvoidmain(String[] args)throws ParseException{try{
BufferedReader br=newBufferedReader(newInputStreamReader(System.in));
String str;while((str=br.readLine())!= null){
Comparator<Integer> cmp =newComparator<Integer>(){publicintcompare(Integer a, Integer b){return Math.abs(b)- Math.abs(a);}};int len = Integer.parseInt(str);
String[] parts = br.readLine().split(" ");
List<String> list = Arrays.asList(parts);
System.out.print(list.get(len-1));for(int i = len-2; i >=0; i--){
System.out.print(" "+list.get(i));}
System.out.println();}}catch(IOException e){
e.printStackTrace();}}}