#include <stdio.h>
#include <stdbool.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <time.h>

typedef struct LNode{
    int data;
    struct LNode *next;
}LNode,*LinkList;

void freeList(LinkList l) {
    LNode *current = l->next;
    while (current != NULL) {
        LNode *temp = current;
        current = current->next;
        free(temp);
    }
    free(l);
}

LinkList InitList(LinkList &l){
    l = (LNode*)malloc(sizeof(LNode));
    if(l) l->next = NULL;
    return l;
}

LinkList list_TailInsert(LinkList &l,int x){
    LNode *s,*r=l;
    int num;
    while(x>0){
        scanf("%d",&num);
        s=(LNode*)malloc(sizeof(LNode));
        s->data = num;
        s->next = NULL; // 新节点的next指针初始化为NULL
        r->next = s; // 将新节点连接到链表的尾部
        r = s; // 更新r指向最后一个节点
        x--;
    }
    return l;
}

int main(){
    Link...