根据用户在C中请求的元素数量创建一个链表

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

Node* head = NULL;

int numElements = 5; // 用户请求的元素数量

for (int i = 0; i < numElements; i++) {
    // 创建新节点
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = i; // 假设数据元素为整数i

    // 将新节点插入链表中
    if (head == NULL) {
        // 如果链表为空，将新节点设置为头节点
        head = newNode;
        newNode->next = NULL;
    } else {
        // 如果链表不为空，将新节点插入链表末尾
        Node* current = head;
        while (current->next != NULL) {
            current = current->next;
        }
        current->next = newNode;
        newNode->next = NULL;
    }
}

Node* current = head;
while (current != NULL) {
    printf("%d ", current->data);
    current = current->next;
}