用C实现一个没有malloc的简单链表

#include <stdio.h>

#define MAX_SIZE 100

typedef struct Node {
    int data;
    int next;
} Node;

Node list[MAX_SIZE];
int head = -1;  // 头节点的索引

// 初始化链表
void initList() {
    for (int i = 0; i < MAX_SIZE; i++) {
        list[i].next = -1;
    }
}

// 在链表末尾插入节点
void insert(int data) {
    int newNodeIndex = -1;
    for (int i = 0; i < MAX_SIZE; i++) {
        if (list[i].next == -1) {
            newNodeIndex = i;
            break;
        }
    }
    if (newNodeIndex == -1) {
        printf("链表已满，无法插入新节点\n");
        return;
    }
    list[newNodeIndex].data = data;
    list[newNodeIndex].next = -1;

    if (head == -1) {
        head = newNodeIndex;
    } else {
        int curIndex = head;
        while (list[curIndex].next != -1) {
            curIndex = list[curIndex].next;
        }
        list[curIndex].next = newNodeIndex;
    }
}

// 打印链表
void printList() {
    int curIndex = head;
    while (curIndex != -1) {
        printf("%d ", list[curIndex].data);
        curIndex = list[curIndex].next;
    }
    printf("\n");
}

int main() {
    initList();

    insert(1);
    insert(2);
    insert(3);

    printList();

    return 0;
}