Problem Description
输入N个整数,按照输入的顺序建立单链表存储,并遍历所建立的单链表,输出这些数据。
Input
第一行输入整数的个数N;
第二行依次输入每个整数。
第二行依次输入每个整数。
Output
输出这组整数。
Sample Input
8 12 56 4 6 55 15 33 62
Sample Output
12 56 4 6 55 15 33 62
Hint
不得使用数组!
Source
#include <stdio.h>
#include <stdlib.h>
struct node
{
int a;
struct node *next;
}*head, *tail, *p;
int main()
{
int n, i;
scanf("%d", &n);
head = (struct node *)malloc(sizeof(struct node));
head -> next = NULL;
tail = head;
for(i = 1; i <= n; i++)
{
p = (struct node *)malloc(sizeof(struct node));
scanf("%d", &p -> a);
p -> next = NULL;
tail -> next = p;
tail = p;
}
p = head -> next;
while(p != NULL)
{
printf("%d", p -> a);
if(p -> next != NULL)
printf(" ");
else printf("\n");
p = p -> next;
}
return 0;
}