数据结构之 线性表--链表的逆置

#include <iostream>
#include <string>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <algorithm>

using namespace std;

struct node
{
    int data;
    struct node *next;
};

int main()
{
    int n;
    int len=0;

    struct node *head, *p;
    head=new struct node;
    head->next=NULL;

    while(cin>>n && n!=-1 )
    {
        p=new struct node;
        p->data = n;
        p->next = head->next;
        head->next=p;
        len++;
    }
    for(int i=1; i<=len; i++)
    {
        if(i==1)
        {
            cout<<head->next->data;
        }
        else
        {
            cout<<" "<<head->next->data;
        }
        head=head->next;
    }
    cout<<"\n";
    return 0;
}