//链表的原地逆转

//链表的原地逆转
#include<iostream>

using namespace std;

//结点
typedef struct node
{
    int data;
    node *next;
}node;
//创建链表
node* create()
{
    node *head,*p,*s;
    head=(node*)malloc(sizeof(node));
    p=head;
    int x,cycle=1;//输入，循环控制值
    while(cycle)
    {
        scanf("%d",&x);
        if(x!=0)
        {
            s=(node*)malloc(sizeof(node));
            s->data=x;
            p->next=s;
            p=s;
        }
        else
            cycle=0;
    }
    head=head->next;
    p->next=NULL;
    return head;
}
void invert(node*&head)
{
    node* p,*q,*r;
    p=head;
    q=head->next;
    while(q!=NULL)
    {
        r=q->next;
        q->next=p;
        p=q;
        q=r;
    }
    head->next=NULL;
    head=p;
}
void print(node *head)
{
    node *p;
    p=head;
    while(p!=NULL)
    {
        cout<<p->data<<" ";
        p=p->next;
    }
    cout<<endl;
}
int main()
{
    node *head;
    head=create();
    print(head);
    invert(head);
    print(head);
    system("pause");
}