数据结构实验之链表三:链表的逆置
Time Limit: 1000MSMemory Limit: 65536KB
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
Hint
不得使用数组。
//C语言
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *creat(int x)
{
struct node *p,*head;
head=(struct node*)malloc(sizeof(struct node));
head->next=NULL;
p=(struct node*)malloc(sizeof(struct node));
p->next=NULL;
while(scanf("%d",&p->data)!=EOF&&p->data!=-1)
{
p->next=head->next;
head->next=p;
p=(struct node*)malloc(sizeof(struct node));
p->next=NULL;
}
return (head);
};
void print(struct node *h)
{
struct node *s=h->next;
while(s!=NULL)
{
if(s->next==NULL)
printf("%d\n",s->data);
else
printf("%d ",s->data);
s=s->next;
}
}
int main()
{
struct node *p=creat(1);
print(p);
return 0;
}
#include <stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *creat(int x)
{
struct node *p,*head;
head=(struct node*)malloc(sizeof(struct node));
head->next=NULL;
p=(struct node*)malloc(sizeof(struct node));
p->next=NULL;
while(scanf("%d",&p->data)!=EOF&&p->data!=-1)
{
p->next=head->next;
head->next=p;
p=(struct node*)malloc(sizeof(struct node));
p->next=NULL;
}
return (head);
};
void print(struct node *h)
{
struct node *s=h->next;
while(s!=NULL)
{
if(s->next==NULL)
printf("%d\n",s->data);
else
printf("%d ",s->data);
s=s->next;
}
}
int main()
{
struct node *p=creat(1);
print(p);
return 0;
}
//C++
#include <iostream>
using namespace std;
typedef struct node
{
int data;
node *next;
};
node *create()
{
node *head,*p;
head=new node;
head->next=NULL;
while(1)
{
p=new node;
cin>>p->data;
if(p->data==-1)
break;
p->next=head->next;
head->next=p;
}
delete p;
return head;
}
void print(node *h)
{
node *p;
p=h->next;
while(p!=NULL)
{
cout<<p->data;
if(p!=NULL)
cout<<" ";
p=p->next;
}
cout<<endl;
}
int main()
{
node *h;
h=create();
print(h);
delete h;
return 0;
}
using namespace std;
typedef struct node
{
int data;
node *next;
};
node *create()
{
node *head,*p;
head=new node;
head->next=NULL;
while(1)
{
p=new node;
cin>>p->data;
if(p->data==-1)
break;
p->next=head->next;
head->next=p;
}
delete p;
return head;
}
void print(node *h)
{
node *p;
p=h->next;
while(p!=NULL)
{
cout<<p->data;
if(p!=NULL)
cout<<" ";
p=p->next;
}
cout<<endl;
}
int main()
{
node *h;
h=create();
print(h);
delete h;
return 0;
}