【掌握链表，C语言编程不再难】从入门到实战示例详解

最佳答案

引言

链表是C言语编程中一种非常重要的数据构造，它容许静态地存储跟管理数据。比拟于数组，链表在处理静态数据时存在更多的上风。本文将从链表的基本不雅点动手，逐步深刻到链表的创建、操纵以及在现实编程中的利用，帮助读者从入门到实战，控制链表的利用。

链表的基本不雅点

1. 链表的定义

链表是由一系列节点构成的线性构造，每个节点包含数据跟指向下一个节点的指针。链表不请求节点在内存中持续存储，因此存在更好的机动性。

2. 链表的范例

• 单链表：每个节点只有一个指向下一个节点的指针。
• 双向链表：每个节点包含指向下一个节点跟前一个节点的指针。
• 轮回链表：链表的最后一个节点的指针指向第一个节点，构成一个轮回。

链表的创建

1. 定义节点构造体

typedef struct Node {
    int data;       // 数据域
    struct Node* next; // 指针域
} Node;

2. 创建新节点

Node* createNode(int data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    if (newNode == NULL) {
        printf("Memory allocation failed!\n");
        return NULL;
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

链表的操纵

1. 拔出节点

void insertNode(Node** head, int data, int position) {
    Node* newNode = createNode(data);
    if (newNode == NULL) {
        return;
    }
    if (*head == NULL || position == 0) {
        newNode->next = *head;
        *head = newNode;
    } else {
        Node* current = *head;
        for (int i = 0; current != NULL && i < position - 1; i++) {
            current = current->next;
        }
        if (current == NULL) {
            printf("Position out of range!\n");
            free(newNode);
        } else {
            newNode->next = current->next;
            current->next = newNode;
        }
    }
}

2. 删除节点

void deleteNode(Node** head, int position) {
    if (*head == NULL) {
        return;
    }
    Node* temp = *head;
    if (position == 0) {
        *head = (*head)->next;
        free(temp);
    } else {
        Node* current = *head;
        for (int i = 0; current->next != NULL && i < position - 1; i++) {
            current = current->next;
        }
        if (current->next == NULL) {
            printf("Position out of range!\n");
        } else {
            Node* next = current->next->next;
            free(current->next);
            current->next = next;
        }
    }
}

3. 遍历链表

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

实战示例

以下是一个简单的链表操纵示例，演示了怎样创建链表、拔出节点、删除节点跟遍历链表。

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

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

Node* createNode(int data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    if (newNode == NULL) {
        printf("Memory allocation failed!\n");
        return NULL;
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

void insertNode(Node** head, int data, int position) {
    Node* newNode = createNode(data);
    if (newNode == NULL) {
        return;
    }
    if (*head == NULL || position == 0) {
        newNode->next = *head;
        *head = newNode;
    } else {
        Node* current = *head;
        for (int i = 0; current->next != NULL && i < position - 1; i++) {
            current = current->next;
        }
        if (current->next == NULL) {
            printf("Position out of range!\n");
            free(newNode);
        } else {
            newNode->next = current->next;
            current->next = newNode;
        }
    }
}

void deleteNode(Node** head, int position) {
    if (*head == NULL) {
        return;
    }
    Node* temp = *head;
    if (position == 0) {
        *head = (*head)->next;
        free(temp);
    } else {
        Node* current = *head;
        for (int i = 0; current->next != NULL && i < position - 1; i++) {
            current = current->next;
        }
        if (current->next == NULL) {
            printf("Position out of range!\n");
        } else {
            Node* next = current->next->next;
            free(current->next);
            current->next = next;
        }
    }
}

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

int main() {
    Node* head = NULL;
    insertNode(&head, 1, 0);
    insertNode(&head, 2, 1);
    insertNode(&head, 3, 2);
    printf("Original list: ");
    traverseList(head);
    deleteNode(&head, 1);
    printf("List after deleting node at position 1: ");
    traverseList(head);
    return 0;
}

总结

经由过程本文的进修，读者应当可能控制链表的基本不雅点、创建、操纵以及在现实编程中的利用。链表是C言语编程中一种重要的数据构造，纯熟控制链表的利用将有助于进步编程程度。