数据结构实验之链表三:链表的逆置
Time Limit: 1000 ms Memory Limit: 65536 KiB
Submit Statistic
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
不得使用数组。
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
};
void show(struct node*head)
{
struct node *p;
p = head->next;
while(p)
{
printf("%d%c", p->data, p->next==NULL? '\n': ' ');
p = p->next;
}
return;
}
int main()
{
struct node *head;
head = (struct node*)malloc(sizeof(struct node));
head->next = NULL;
int n;
while(1)
{
scanf("%d", &n);
if(n==-1)
break;
struct node*p;
p = (struct node*)malloc(sizeof(struct node));
p->next = NULL;
p->data = n;
p->next = head->next;
head->next = p;
}
show(head);
return 0;
}
/***************************************************
User name: jk160532姜兴友
Result: Accepted
Take time: 0ms
Take Memory: 152KB
Submit time: 2017-10-08 13:44:25
****************************************************/