#include<iostream>
#include<cstdlib>
using namespace std;
typedef struct Node
{
int date;
struct Node* pre;
struct Node* next;
struct Node* last;
}node;
node* creat(int n)
{
node* head = (node*)malloc(sizeof(node));
cin >> head->date;
head->pre = NULL;
head->next = NULL;
node* q=head;
for (int i = 0; i < n; i++)
{
node* p = (node*)malloc(sizeof(node));
cin >> p->date;
p->next = NULL;//此时尾节点其实就是p,所以要将尾节点的尾指针指向NULL
q->next = p;
p->pre = q;//将p的头指针指向前一个节点
q = q->next;//将q移到q的位置,方便,下一次输入将数据插入尾部
}
return head;
}
node* reverslist(node* head)
{
node* pre = NULL;
node* next = NULL;
node* last = NULL;
while (head != NULL)
{
next = head->next;
head->next = pre;
head->last = next;
pre=head;
head = next;
}
return pre;//返回的是链表最尾部的数据,是“新头”
}
void print(node* head) {//遍历输出链表
node* p = head;
while (p != NULL) {//将链表从头开始打印
cout << p->date << " ";
p = p->next;//指向后一个节点
}
cout << endl;
}
int main()
{
int n;
cin >> n;
node* head = creat(n);
node* newhead=reverslist(head);
print(newhead);
return 0;
}