单向链表

1.单个节点实现，头节点做标识存储为空

typedef struct Lnode{
    Elemtype data;
    struct Lnode *next;
}Lnode,*LinkList;

2. 建立单链表 1.头部插入建立

   LinkList HeadCreate(Lnode *head)
{
    Lnode *s;
    Elemtype x=0;
    cin>>x;
    while(x!=999)
{
   
    head->next = x;
    s = (Lnode *)malloc(sizeof(Lnode));
    s->data = x;
    s->next = head->next;
    head->next = s;
    cin >> x;
}
    reurn head;
}

2. 尾部插入建

    LinkList LastCreat(Lnode *head)
{
   Lnode *s;
   Lnode *r = head;
   Elemtype x;
   cin >> x;
   while(x!=999)
   {
       s = new Lnode;
       r->next = s;
       s->data = x;
       r = s;
       cin >> x;
   }
   s->next = NULL;
   reurn head;
}

---

本文章使用limfx的vscode插件快速发布