C语言实现双向循环链表

最新推荐文章于 2023-03-02 23:54:44 发布

labrary

最新推荐文章于 2023-03-02 23:54:44 发布

阅读量728

点赞数

分类专栏： C/C++ 文章标签：算法

C/C++ 专栏收录该内容

27 篇文章

订阅专栏

本文介绍了一种双向循环链表的实现方法，并提供了初始化、遍历、插入、删除等核心操作的具体代码。通过实例展示了如何使用这些函数创建、操作链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

2009-04-16 21:45:56

这种方法见到过，也用过，转载过来记录一下：

原文地址：http://blog.chinaunix.net/uid-20696246-id-1892194.html

/* 双向循环链表，带头指针 */ struct list_node { struct list_node *prev, *next; }; /* 初始化头指针 */ void list_init_head(struct list_node* head) { head->prev = head->next = head; } /* 量表是否为空是返回1，否返回0 */ int list_is_empty(const struct list_node* head) { return (head->prev == head) && (head->next == head); } /* 链表遍历 */ #define list_for_each(iter, head) \ for (iter = (head)->next; iter != (head); iter = iter->next) /* 链表逆序遍历 */ #define list_for_each_reverse(iter, head) \ for (iter = (head)->prev; iter != (head); iter = iter->prev) /* 链表遍历，支持删除操作 */ #define list_for_each_remove(iter, n, head) \ for (iter = (head)->next, n = iter->next; iter != (head); iter = n, n = iter->next) /* 求包含此链表的结构体指针 */ #define list_entry(ptr, type, member) \ ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) static void __list_insert(struct list_node* node, struct list_node* prev, struct list_node* next) { prev->next = next->prev = node; node->prev = prev; node->next = next; } /* 插入头节点 */ void list_push_front(struct list_node* head, struct list_node* node) { __list_insert(node, head, head->next); } /* 插入尾节点 */ void list_push_back(struct list_node* head, struct list_node* node) { __list_insert(node, head->prev, head); } static void __list_delete(struct list_node* prev, struct list_node* next) { prev->next = next; next->prev = prev; } /* 移除节点 */ void list_remove(struct list_node* node) { __list_delete(node->prev, node->next); node->prev = node->next = NULL; } /* 链表接合将list接合到head,新链表的头节点仍为head */ void list_splice(struct list_node* head, struct list_node* list) { if (list_is_empty(list) == 0) { list->next->prev = head; head->prev = list->next; list->prev->next = head->next; head->next->prev = list->prev; } }

#include <stdio.h> #include <malloc.h> #include "list.h" struct Stu { int no; int age; struct list_node list; }; int main() { struct list_node* iter; struct Stu head; struct Stu* p; list_init_head(&head.list); int i = 5; while (i--) { struct Stu* stu = (struct Stu*)malloc(sizeof(struct Stu)); if(stu != NULL) { stu->no = i; stu->age = i+3; list_push_back(&head.list, &stu->list); } } list_for_each(iter, &head.list) { p = list_entry(iter, struct Stu, list); printf("%d, %d\n", p->no, p->age); } printf("\nReversed list:\n"); list_for_each_reverse(iter, &head.list) { p = list_entry(iter, struct Stu, list); printf("%d, %d\n", p->no, p->age); } struct list_node* iter_backup; list_for_each_remove(iter, iter_backup, &head.list) { p = list_entry(iter, struct Stu, list); list_remove(iter); free(p); } return 0; }