全ACGO第一个不用数组不用栈的题解

#include <iostream>

using namespace std;

typedef struct ListNode{
    ListNode *prev;
    int val;
    ListNode *next;
    ListNode(ListNode *p, int v) : prev(p), val(v), next(nullptr){}
}Node;

void print(Node *tail, int n) {
    Node *p = tail;
    for(int i=1;i<=n;i++) {
        cout << p->val << ' ';
        p = p->prev;
    }
}

int main(int argv, char* args[]){
    int n;
    cin >> n;
    Node *tail = new ListNode(nullptr, 0);
    for(int i=1;i<=n;i++) {
        int num;
        cin >> num;
        Node *nd = new ListNode(tail, num);
        tail->next = nd;
        tail = nd;
    }
    print(tail, n);
    return 0;
}