逆置部分有亮点,(__) 嘻嘻……
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node*next;
};
struct node *create( )
{
struct node*head,*tail,*p;
head=(struct node*)malloc(sizeof(struct node));
head->next=NULL;
tail=head;
int x;
scanf("%d",&x);
while(x!=-1)
{
p=(struct node*)malloc(sizeof(struct node));
p->data=x;
p->next=NULL;
tail->next=p;
tail=p;
scanf("%d",&x);
}
return head;
};
void reverse(struct node*head)//******
{
struct node *p,*q;
p=head->next;
head->next=NULL;
while(p)
{
q=p->next;//把p后面的节点存一下,以防丢失
// if(q)
// {
p->next=head->next;//类似逆序建链表
head->next=p;
//}
p=q;//往后移
}
};
void print(struct node*head)
{
struct node*p;
p=head->next;
while(p)
{
printf("%d",p->data);
if(p->next) printf(" ");
else printf("\n");
p=p->next;
}
}
int main()
{
struct node*head;
head=create();
reverse(head);
print(head);
return 0;
}