Problem Description
输入N个整数,按照输入的顺序建立单链表存储,并遍历所建立的单链表,输出这些数据。
Input
第一行输入整数的个数N;
第二行依次输入每个整数。
第二行依次输入每个整数。
Output
输出这组整数。
Example Input
8 12 56 4 6 55 15 33 62
Example Output
12 56 4 6 55 15 33 62
01 | #include<stdio.h> |
02 | #include<stdlib.h> |
03 | struct node |
04 | { |
05 | int date; |
06 | struct node * next; |
07 | } *head, *tail, *p; |
08 | int main() |
09 | { |
10 | int n, i; |
11 | scanf ( "%d" , &n); |
12 | head = ( struct node *) malloc ( sizeof ( struct node)); |
13 | head -> next = NULL; |
14 | tail = head; |
15 | for (i = 1; i <= n; i++) |
16 | { |
17 | p = ( struct node *) malloc ( sizeof ( struct node)); |
18 | scanf ( "%d" , &p -> date); |
19 | p -> next = NULL; |
20 | tail -> next = p; |
21 | tail = p; |
22 | } |
23 | p = head -> next; |
24 | while (p != NULL) |
25 | { |
26 | printf ( "%d" , p -> date); |
27 | if (p -> next != NULL) |
28 | { |
29 | printf ( " " ); |
30 | } |
31 | else |
32 | { |
33 | printf ( "\n" ); |
34 | } |
35 | p = p -> next; |
36 | } |
37 | return 0; |
38 | } |