题目描述
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.
输入
5
-3 4 6 -8 9
输出
9 -8 6 4 -3
代码
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int data[n];
for(int i=0;i<n;i++)
{
cin>>data[i];
}
int temp=0;
for(int i=0;i<n/2;i++)
{
temp=data[i];
data[i]=data[n-i-1];
data[n-1-i]=temp;
}
for(int i=0;i<n;i++)
{
cout<<data[i]<<" ";
}
return 0;
}
分析题目可知为线性表的原地逆置
so easy~