数据结构实验之链表一：顺序建立链表 (sdut oj)

数据结构实验之链表一：顺序建立链表

Problem Description

Input

Output

Example Input

8
12 56 4 6 55 15 33 62

Example Output

12 56 4 6 55 15 33 62

Hint

Author

参考代码

#include<stdio.h>
#include<stdlib.h>

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

int main()
{
int n;
struct node *head,*p,*tail;
scanf("%d",&n);
head = (struct node *)malloc(sizeof(struct node));
head->next = NULL;
tail = head;
while(n--)
{
p = (struct node *)malloc(sizeof(struct node));
scanf("%d",&p->data);
p->next = tail->next;
tail->next = p;
tail = p;
}
p = head->next;
printf("%d",p->data);
p = p->next;
while(p)
{
printf(" %d",p->data);
p = p->next;
}
return 0;
}