顺序结构的单链表实现

#include <stdio.h>
#include <stdlib.h>

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

LinkList initList() {
    LinkList L = (LinkList *) malloc(sizeof(LinkList));
    if (L == NULL) {
        return -1;
    }
    L->next = NULL;
    return L;
}

int ListEmpty(LinkList L) {
    if (L->next)
        return 1;
    else
        return 0;
}

void DestroyList(LinkList L) {
    LinkList P;
    while (L) {
        P = L;
        L = L->next;
        free(P);
    }
}

void InsertList(LinkList L, int num) {
    LinkList pNew = (LinkList *) malloc(sizeof(LinkList));
    pNew->next = L->next;
    pNew->data = num;
    L->next = pNew;
}

void printList(LinkList L) {
    LinkList P = L->next;
    while (P) {
        printf("%d\n", P->data);
        P = P->next;
    }
}

void CleanList(LinkList L) {
    LinkList P, Q;
    P = L->next;
    while (P) {
        Q = P->next;
        free(P);
        P = Q;
    }
    L->next = NULL;
}

int main() {
    LinkList pHead = initList();
    if (ListEmpty(pHead)) {
        printf("表不为空\n");
    } else {
        printf("表空\n");
    }
    for (int i = 0; i < 5; ++i) {
        InsertList(pHead, i);
    }
    printList(pHead);
    if (ListEmpty(pHead)) {
        printf("表不为空\n");
    } else {
        printf("表空\n");
    }
    CleanList(pHead);
    if (ListEmpty(pHead)) {
        printf("表不为空\n");
    } else {
        printf("表空\n");
    }
    return 0;
}