#include <iostream>
using namespace std;
//任务:将顺序表L逆置,空间复杂度为o(1)
#define Initsize 50
typedef struct {
int* data;
int length, maxsize;
}SqList;
//初始化
void Init(SqList& L)
{
int i;
L.data = new int[Initsize];
for ( i = 0; i < 6; i++)
{
cin >> L.data[i];
}
L.length = i;
}
//第一个与最后一个互换,奇数个时,i=j,偶数个时,i>j
bool Reverse(SqList& L)
{
int i = 0, j = L.length - 1,temp;
while (i<j)
{
temp = L.data[i];
L.data[i] = L.data[j];
L.data[j] = temp;
i++; j--;
}
return true;
}
int main()
{
SqList L;
Init(L);
Reverse(L);
for (int i = 0; i < L.length; i++)
cout << L.data[i] << " ";
return 0;
}