資料結構實驗之連結串列二：逆序建立連結串列

Time Limit: 1000MS Memory Limit: 65536KB

Problem Description

Input

Output

Example Input

10
11 3 5 27 9 12 43 16 84 22 

Example Output

22 84 16 43 12 9 27 5 3 11 

Hint

#include <bits/stdc++.h>
using namespace std;

typedef struct node
{
    int date;
    struct node *next;
}Lnode;

Lnode *creat(int n)
{
    Lnode *p,*head;
    head = new node;
    head -> next = NULL;
    for(int i = 0; i < n; i++)
    {
        p = new node;
        p -> next = NULL;
        cin >> p->date;
        p->next = head ->next;
        head ->next = p;
    }
    return head;
}

void output( Lnode *head)
{
    Lnode *q;
    q = head ->next;
    cout << q ->date;
    while(q->next)
    {
        cout << " " << q ->next ->date;
        q = q ->next;
    }
    cout << endl;
}

int main()
{
    int n;
    Lnode *head;
    cin >> n;
    head = creat(n);
    output(head);
    return 0;
}