C从txt文件中读取并存储在链表中

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

// 定义链表节点结构体
typedef struct Node {
    char data[100]; // 假设每行数据最大长度为100
    struct Node* next;
} Node;

// 读取txt文件并存储在链表中
Node* readTxtFileToList(const char* filename) {
    FILE* file = fopen(filename, "r"); // 打开txt文件
    if (file == NULL) {
        printf("Failed to open file: %s\n", filename);
        return NULL;
    }

    Node* head = NULL;
    Node* tail = NULL;

    char line[100];
    while (fgets(line, sizeof(line), file)) { // 逐行读取文件内容
        // 创建新节点
        Node* newNode = (Node*)malloc(sizeof(Node));
        if (newNode == NULL) {
            printf("Failed to allocate memory.\n");
            break;
        }
        newNode->next = NULL;

        // 存储数据到新节点的数据域
        strncpy(newNode->data, line, sizeof(newNode->data));

        if (head == NULL) {
            head = newNode;
            tail = newNode;
        } else {
            tail->next = newNode;
            tail = tail->next;
        }
    }

    fclose(file); // 关闭文件

    return head;
}

int main() {
    const char* filename = "data.txt";
    Node* head = readTxtFileToList(filename);
    if (head == NULL) {
        printf("Failed to read and store data from txt file.\n");
        return -1;
    }

    // 打印链表中的数据
    Node* curr = head;
    while (curr != NULL) {
        printf("%s", curr->data);
        curr = curr->next;
    }

    // 释放链表内存
    Node* temp;
    curr = head;
    while (curr != NULL) {
        temp = curr->next;
        free(curr);
        curr = temp;
    }

    return 0;
}