对于静态链表的理解

#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;
ListPtr initLinkedList(){
    ListPtr tempPtr = (ListPtr)malloc(sizeof(struct StaticLinkedList));
    tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);//申请5个元素的空间
    tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);
    tempPtr->nodes[0].data = '\0';
    tempPtr->nodes[0].next = -1;
    tempPtr->used[0] =1;//初始化
    for (int i = 1; i <DEFAULT_SIZE;i++){
      tempPtr->used[i] = 0;//全部置为空
    }
	  return tempPtr;
}
void printList(ListPtr paraListPtr){//打印给出的静态链表
    int p = 0;
    while (p !=-1) {
      printf("%c", paraListPtr->nodes[p].data);
      p = paraListPtr->nodes[p].next;
    }
    printf("\r\n");
}
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition){
    int p, q, i;
    p = 0;
    for (i = 0; i < paraPosition;i++) {
      p = paraListPtr->nodes[p].next;
      if (p == -1) {
        printf("The position %d is beyond the scope of the list.\r\n", paraPosition);
        return;
      }
    }
    for (i = 1; i < DEFAULT_SIZE;i++){
      if (paraListPtr->used[i] == 0){
        printf("Space at %d allocated.\r\n", i);
        paraListPtr->used[i] = 1;
        q = i;
        break;
      }
    }
    if (i == DEFAULT_SIZE){
      printf("No space.\r\n");
      return;
    }
    paraListPtr->nodes[q].data = paraChar;
    printf("linking\r\n");
    paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
    paraListPtr->nodes[p].next = q;
}
void deleteElement(ListPtr paraListPtr, char paraChar){
    int p, q;
    p = 0;
    while ((paraListPtr->nodes[p].next!=-1)&&(paraListPtr->nodes[paraListPtr->nodes[p].next].data!= paraChar)){
      p = paraListPtr->nodes[p].next;
    }
    if (paraListPtr->nodes[p].next ==-1) {
      printf("Cannot delete %c\r\n", paraChar);
      return;
    }
    q = paraListPtr->nodes[p].next;
    paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
    
    paraListPtr->used[q]=0;
}
void appendInsertDeleteTest(){
    ListPtr tempList = initLinkedList();
    printList(tempList);
    insertElement(tempList, 'H', 0);
    insertElement(tempList, 'e',  1);
    insertElement(tempList, 'l', 2);
    insertElement(tempList, 'l', 3);
    insertElement(tempList, 'o', 4);
    printList(tempList);
    printf("Deleting 'e'.\r\n");
    deleteElement(tempList, 'e');
    printf("Deleting 'a'.\r\n");
    deleteElement(tempList, 'a');
    printf("Deleting 'o'.\r\n");
    deleteElement(tempList, 'o');
    printList(tempList);
    insertElement(tempList, 'x', 1);
    printList(tempList);
}

void main(){
    appendInsertDeleteTest();
    system("pause");
}

 正如闵老师所说：静态链表有助于理解操作系统空间分配机制。通过学习我体会到了“成为电脑”的感受，对于电脑分配内存的行为有了更进一步的认识和理解。而我认为，对于静态链表和动态链表，两者的逻辑确实是一模一样：数组的下标模拟了地址的偏移，仅此而已。