数据结构实验之链表三：链表的逆置 (sdut oj)

数据结构实验之链表三：链表的逆置

Problem Description

Input

Output

Example Input

12 56 4 6 55 15 33 62 -1

Example Output

62 33 15 55 6 4 56 12

Hint

Author

参考代码

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

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

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