链表的实现

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67

#include<iostream> #include<stdlib.h> using namespace std; typedef int ElemType; typedef struct Node {     ElemType data;     struct Node* next; }*LinkList,Node;   LinkList LinkListCreate() {     int data;     Node *L=(Node*)malloc(sizeof(Node));     if(L==NULL) cout<<"Error"<<endl;     L->next=NULL;     Node *r;     r=L;     while(cin>>data)     {         if(data<0) break;         Node *p=(Node*)malloc(sizeof(Node));         if(p==NULL) cout<<"Error"<<endl;         p->next=NULL;         p->data=data;         r->next=p;         r=r->next;     }     return L; }   LinkList LinkListDelete(LinkList L,int data) {     Node *pre,*p;     pre=L;     p=L->next;     while(p && p->data!=data)     {         pre=p;         p=p->next;     }     if(pre->next) pre->next=p->next;     free(p);     return L; }   LinkList LinkListPrint(LinkList L) {    Node *p;    p=L->next;    while(p)    {        cout<<p->data<<endl;        p=p->next;    }    return L; }   int main() {     int x;     LinkList L=LinkListCreate();     cin>>x;     LinkListDelete(L,x);     LinkListPrint(L);     return 0; }