数据结构实验之链表三:链表的逆置
Time Limit: 1000MS
Memory Limit: 65536KB
Submit
Statistic
Problem Description
输入多个整数,以-1作为结束标志,顺序建立一个带头结点的单链表,之后对该单链表的数据进行逆置,并输出逆置后的单链表数据。
Input
输入多个整数,以-1作为结束标志。
Output
输出逆置后的单链表数据。
Example Input
12 56 4 6 55 15 33 62 -1
Example Output
62 33 15 55 6 4 56 12
01 | #include <stdio.h> |
02 | #include <stdlib.h> |
03 | struct node |
04 | { |
05 | int data; |
06 | struct node *next; |
07 | }; |
08 | int main() |
09 | { |
10 | int n; |
11 | struct node *p, *q, *tail, *head; |
12 | head = ( struct node *) malloc ( sizeof ( struct node)); |
13 | head->next = NULL; |
14 | tail = head; |
15 | while (n!=-1) |
16 | { |
17 | p = ( struct node *) malloc ( sizeof ( struct node)); |
18 | scanf ( "%d" , &n); |
19 | if (n!=-1) |
20 | { |
21 | p->next = tail->next; |
22 | tail->next = p; |
23 | tail = p; |
24 | p->data = n; |
25 | } |
26 | } |
27 | p = head->next; |
28 | head->next = NULL; |
29 | q = p->next; |
30 | while (p!=NULL) |
31 | { |
32 | p->next = head->next; |
33 | head->next = p; |
34 | p = q; |
35 | if (q!=NULL) |
36 | { |
37 | q = q->next; |
38 | } |
39 | } |
40 | p = head->next; |
41 | while (p->next!=NULL) |
42 | { |
43 | printf ( "%d " , p->data); |
44 | p = p->next; |
45 | } |
46 | printf ( "%d\n" , p->data); |
47 | return 0; |
48 | } |