【数据结构】双向循环链表增、删、改、查

源码

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

typedef int E;

struct ListNode {
    E element;
    struct ListNode *next;
    struct ListNode *prev;
};

typedef struct ListNode *Node;

// 双向循环链表初始化
void initList(Node head) {
    head->next = head->prev = head;
}

// 双向循环链表 - 插入
_Bool insertList(Node head, E element, int index) {
    if (index < 1) return 0;
    while (--index && head->next != head) {
        head = head->next;
    }
    Node node = malloc(sizeof(struct ListNode));
    if (node == NULL) return 0;
    node->element = element;

    node->next = head->next;
    head->next->prev = node;
    head->next = node;
    node->prev = head;

    // 如果插入的是最后一个节点，需要更新最后一个节点的 next 指针为头节点，形成循环
    if (node->next == head) {
        head->prev = node;
    }

    return 1;
}

// 双向循环链表 - 删除
int deleteList(Node head, int index) {
    if (index < 1) return 0;
    while (--index && head->next != head) {
        head = head->next;
    }

    if (head->next == head) return 0;  // 没有找到要删除的节点

    Node tem = head->next;
    tem->next->prev = head;
    head->next = tem->next;

    free(tem);

    // 如果删除的是最后一个节点，需要更新头节点的 prev 指针为前一个节点，形成循环
    if (head->next == head) {
        head->prev = head;
    } else {
        head->next->prev = head;
    }

    return 1;
}

int main(void) {
    struct ListNode head;
    initList(&head);

    // 插入节点
    for (int i = 0; i < 5; i++) {
        insertList(&head, i + 1, i + 1);
    }

    // 删除节点
    deleteList(&head, 4);

    // 遍历链表正向输出
    Node node = head.next;
    do {
        printf("%d -> ", node->element);
        node = node->next;
    } while (node != &head);
    printf("\n");

    // 遍历链表反向输出
    node = head.prev;
    do {
        printf("%d -> ", node->element);
        node = node->prev;
    } while (node != &head);
    printf("\n");

    return 0;
}