静态链表代码分析

#include <stdio.h>
#include <malloc.h>

#define DEFAULT_SIZE 5

typedef struct StaticLinkedNode{
    char data;

    int next;
} *NodePtr;

typedef struct StaticLinkedList{
    NodePtr nodes;
    int* used;
} *ListPtr;

/**
 * Initialize the list with a header.
 * @return The pointer to the header.
 */
ListPtr initLinkedList(){
    // The pointer to the whole list space.
    ListPtr tempPtr = (ListPtr)malloc(sizeof(struct StaticLinkedList));

    // Allocate total space.
    tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
    tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);

    // The first node is the header.
    tempPtr->nodes[0].data = '\0';
    tempPtr->nodes[0].next = -1;

    // Only the first node is used