#include <iostream>#include <stdio.h>
#include <stdlib.h>using namespace std;//带头指针的单链表typedef  struct  LNode{int data;struct LNode *next;}LNode, *LinkList;bool InitList(LinkList &L){L = (LNode *) malloc(sizeof(LNode));if(L== NULL){return false;  //内存不足分配失败}L->next =NULL;return true;
}
bool empty(LinkList &L){return  (L->next==NULL);
}LinkList List_TailInsert(LinkList &L){LNode *s,*r = L;int x;scanf("%d",&x);while(x!=9999){s = (LNode *)malloc(sizeof(LNode));s->data = x;r->next = s;r=s;scanf("%d",&x);}r->next = NULL;return L;}int main(){LinkList L;InitList(L);List_TailInsert(L);LNode *p = L->next;while(p){printf("%d \n",p->data);p=p->next;}return 0;
}