数据结构实验之链表三:链表的逆置
Time Limit: 1000 ms Memory Limit: 65536 KiB
Problem Description
输入多个整数,以-1作为结束标志,顺序建立一个带头结点的单链表,之后对该单链表的数据进行逆置,并输出逆置后的单链表数据。
Input
输入多个整数,以-1作为结束标志。
Output
输出逆置后的单链表数据。
Sample Input
12 56 4 6 55 15 33 62 -1
Sample Output
62 33 15 55 6 4 56 12
Hint
不得使用数组。
Source
#include <iostream>
using namespace std;
struct node
{
int data;
struct node *next;
};
node *create()
{
int n;
node *head, *tail, *p;
head = new node;
head->next = NULL;
tail = head;
while(cin>>n&&n!=-1)
{
p = new node;
p->data = n;
p->next = NULL;
tail->next = p;
tail = p;
}
return head;
}
void reverse(node *head)
{
node *p, *q;
p = head->next;
head->next = NULL;
q = p->next;
while(p)
{
p->next = head->next;
head->next = p;
p = q;
if(q)
q = q->next;
}
}
void print(node *head)
{
node *p;
p = head->next;
while(p)
{
cout<<p->data;
if(p->next!=NULL)
cout<<' ';
p = p->next;
}
cout<<endl;
}
int main()
{
node *head;
head = create();
reverse(head);
print(head);
return 0;
}