数据结构实验之链表二：逆序建立链表（SDUT 2117）

题目链接

#include <bits/stdc++.h>

using namespace std;

struct node
{
    int data;
    struct node *next;
};
int main()
{
    int n;
    struct node *head,*p;
    head = new node;
    head -> next = NULL;
    scanf("%d",&n);
    for(int i = 0; i < n; i ++)
    {
        p = new node;
        p -> next = NULL;
        scanf("%d", &p -> data);
        p -> next = head -> next;
        head -> next = p;
    }
    for(p = head -> next ; p != NULL; p = p -> next)
    {
        if(p == head -> next)
            printf("%d",p->data);
        else
            printf(" %d",p->data);
    }
    printf("\n");
    return 0;
}

 

转载于:https://www.cnblogs.com/lcchy/p/10139509.html