线性表链表实现

#include<bits/stdc++.h>
using namespace std;
#define sc scanf
#define ElemType int 
//线性表的链式表示和实现

typedef struct LNode{
    int data;
    struct LNode *next;
}LNode,*LinkList;
//关于上面为啥是这样子的，看下面链接即可
//https://zhidao.baidu.com/question/489369235.html
 
//还有就是下面每个函数传参数的类型，为啥是那样？
//你需要一定的基础，就是对指针和引用的了解
//还有指针引用和引用指针的区别 ，传送门：https://blog.csdn.net/eye123456789/article/details/79794461 

//创建链表,有n个结点 
void CreateList(LinkList &L,int n)
{
    L = (LinkList)malloc(sizeof(LNode));
    L->next = NULL;//创建一个带头结点的单链表
    L->data = 0;//用于记录当前链表的元素个数 
    
    LNode *p;
    for(int i = n;i > 0;i--)
    {
        p = (LinkList)malloc(sizeof(LNode));//生成新节点 
        sc("%d",&p->data);
        p->next = L->next;
        L->next = p;
    } 
} 

//插入元素
bool LinkInsert_L(LinkList &L,int i,ElemType e)
{
    LNode *p = L; 
    int j = 0;
    while(p && j < i - 1)
    {
        p = p->next;
        ++j;
    }
    
    //判断是否非法位置
    if(!p || j > i - 1) {
        puts("Oh! Baby! The insertion position is invalid. Please re-enter the insertion position!");
        return 0; 
    }
    
    LNode *s = (LinkList)malloc(sizeof(LNode));
    s->data = e;
    s->next = p->next;
    p->next = s;
    return 1;
} 

//链表删除元素
bool ListDelete_L(LinkList &L,int i,int &e)
{
  //删除第i个元素 
  LNode *p = L; int j = 0;
      while(p->next && j < i - 1)
    {
        p = p->next;
        ++j;
    }
    
    //判断是否非法位置
    if(!(p->next) || j > i - 1) {
        puts("Oh! Baby! The position is invalid. Please re-enter the position!");
        return 0; 
    }
    
    LNode *q = (LinkList)malloc(sizeof(LNode));
    q = p->next;
    p->next = q->next;
    e = q->data;
    free(p);
    return 1; 
} 

//合并链表
void MergeList(LinkList &la,LinkList &lb,LinkList &lc)
{
    LNode *pa,*pb,*pc;
    pa = la->next; pb = lb->next;
    lc = pc = la;
    
    while(pa && pb)
    {
        if(pa->data <= pb->data){
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        }
        else{
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        }
    }    
    pc->next = pa? pa:pb;
    free(lb);
} 

//获取链表长度
int getListLength(LinkList &L)
{
    LNode *p = L;
    int cnt = 0;
    while(p->next != NULL)
    {
        p = p->next;
        ++cnt;
        //cout << p->data << " ";
    }
    return cnt;
}

//获取链表的某个元素
bool getElem(LinkList &L,int q,int &e) {
    
    int length = getListLength(L);
    if(q < 1 || q > length)
    {
        puts("Oh! Baby! The  position is invalid. Please re-enter the position!");
        return 0;
    }
    LNode *p = L;
    int j = 0;
    while(p->next && j < q - 1)
    {
        p = p->next;
        j++;
    }
    if(p->next == NULL)
    {
        puts("Sorry, didn't find it");
        return 0;
    }
    else{
        p = p->next;
        e = p->data;
        return 1;
    }
}

void Reverse_List(LinkList &la,LinkList &lb)
{
      LNode *p = la;
      while(p->next != NULL)
      {
          p = p->next;
          if(p != NULL)
          LinkInsert_L(lb,1,p->data);
    }
}

//遍历链表 
void LinkList_Traver(LinkList &L)
{
    LNode *p = L;
    puts("Let's do it! Traver! Traver_List!"); 
    while(p->next != NULL)
    {
        p = p->next;
        cout << p->data << " ";
    }
    puts("");
} 

//销毁链表 
bool List_Destroed(LinkList &L)
{
    LNode *p;
    if(L == NULL) return 0;
    while(L->next)
    {
        p = L->next;
        free(L);
        L = p;
     } 
    return 1;
}
int main()
{
    LinkList la,lb,lc,ld;
    int n;
    sc("%d",&n);
    CreateList(la,n);
    CreateList(lb,n);
    CreateList(ld,0);
    
    
//    for(int i = 1;i <= 5;i++)
//    {
//        LinkInsert_L(la,i,i);
//    }
    
    cout << "la length = " << getListLength(la) << endl;
    cout << "lb length = " << getListLength(lb) << endl;
    
    int ele;
    if(getElem(la,5,ele))
    {
        cout << ele << endl;
    }
    
    if(getElem(lb,1,ele))
    {
        cout << ele << endl;
    }
    
    LinkList_Traver(la);
    LinkList_Traver(lb);
    
    MergeList(la,lb,lc);
    LinkList_Traver(la);
    LinkList_Traver(lc);
    
    Reverse_List(la,ld);
    cout << "Traver ld = ";
    LinkList_Traver(ld);
    
    List_Destroed(la);
    LinkList_Traver(la);
    return 0;;
}