数据结构实验之链表二：逆序建立链表

数据结构实验之链表二：逆序建立链表

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

--------------------------------------------------------------------------------------------------------

#include<stdio.h>
#include<malloc.h>

struct node{
int data;
struct node *next;
};

struct node *creat(int n){
struct node *head, *p;
head = (struct node*)malloc(sizeof(struct node));
head->next = NULL;
for(int i=0; i<n; i++){
p = (struct node*)malloc(sizeof(struct node));
scanf("%d", &p->data);
p->next = head->next;
head->next = p;
}
return head;
};

void show(struct node *head){
struct node *p;
p = head->next;
while(p){
printf("%d%c", p->data, p->next==NULL?'\n':' ');
p = p->next;
}
}

int main(){
int n;
struct node *head;
scanf("%d", &n);
head = creat(n);
show(head);
return 0;
}