逆序建链表

1.建立一个新的结点

 2.让这个结点的next指向头结点的next

 3.让头结点的next指向该结点

#include <iostream>#include<stdlib.h>using namespace std;struct node{    int x;    struct node *next;};//逆序建表struct node* creatListNi(int lenth){    struct node *head,*p;    int i;    head=(struct node*)malloc(sizeof(struct node));    head->next=NULL;    for(i=0; i<lenth; i++)    {        p=(struct node*)malloc(sizeof(struct node));        p->x=i;        p->next=head->next;        head->next=p;    }    return head;}int main(){    struct node *head,*t;//逆序建链表    head=creatListNi(10);    t=head->next;    cout<<"逆序建链表 :";    while(t!=NULL)    {        cout<<t->x<<" ";        t=t->next;    }    cout<<endl;    return 0;}