当前位置：首页 > news >正文

C语言双向循环链表踩坑全记录：从段错误到可运行完整实现

news 2026/6/4 13:07:06

下面这一整段直接全部复制，粘贴到博客园内容框里就能用，格式干净、专业、非常适合给面试官看。

双向循环链表实现与问题解决全记录

项目概述

本项目基于 C 语言实现了带头结点的双向循环链表，支持节点创建、指定位置前插/后插、按值删除、遍历打印等完整功能。在实现过程中，针对空指针访问、无限循环、双向指针维护缺失、逻辑分支顺序不当等问题进行了系统性分析与修复，最终形成结构清晰、健壮稳定、覆盖所有边界场景的链表实现。

开发中遇到的核心问题与解决方案

1. 空指针访问导致段错误

问题现象：空链表时直接访问指针成员，程序崩溃。
问题根源：依赖外部判空，函数内部未做安全校验。
解决思路：采用防御式编程，所有链表操作函数入口先做空指针判断，从根源避免空指针访问。

2. 循环条件错误导致无限循环

问题现象：使用普通单向链表遍历方式，循环无法正常退出。
问题根源：忽略双向循环链表不存在 NULL 结尾的结构特点。
解决思路：以“遍历一圈回到起点”作为循环终止条件，保证安全且完整遍历。

3. 仅维护 next 指针导致链表断链

问题现象：插入删除后正向遍历正常、反向异常，结构不稳定。
问题根源：未理解双向链表必须同时维护前后指针。
解决思路：任何指针修改都同步更新 next 和 pre，保证链表结构完整。

4. 逻辑分支与条件执行顺序隐患

问题现象：节点不存在时仍可能执行危险指针操作导致崩溃。
问题根源：对 else if 条件表达式执行顺序理解不完整。
解决思路：严格遵循“先校验、后操作”原则：先判空 → 查节点存在性 → 最后执行指针修改。

完整可运行代码

/******************************************* file name: circle_double_list.c* author   : 107281174@qq.com* date     : 2025* brief    : 双向循环链表完整实现* note     : 含插入、删除、遍历及边界处理******************************************/
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>typedef int DataType;
typedef struct CicleDou
{DataType data;struct CicleDou *next;struct CicleDou *pre;
} CD;CD *HeadCD()
{CD *Head = (CD *)calloc(1, sizeof(CD));Head->next = NULL;return Head;
}CD *SigleCD(int data)
{CD *sc = (CD *)calloc(1, sizeof(CD));sc->data = data;sc->next = NULL;sc->pre = NULL;return sc;
}CD *WhileCD(CD *Head)
{if (Head == NULL || Head->next == NULL)return NULL;CD *p = Head;CD *pn = Head->next;while (pn->next != Head->next){pn = pn->next;p = p->next;}return p;
}CD *WhileAimCD(CD *Head, DataType data)
{if (Head == NULL || Head->next == NULL)return NULL;CD *p = Head;CD *pr = Head->next;if (pr->data == data)return Head;while (pr->next != Head->next){p = p->next;pr = pr->next;if (pr->data == data)return p;}printf("未找到目标数据\n");return NULL;
}void PfCD(CD *Head)
{if (Head == NULL || Head->next == NULL){printf("链表为空\n");return;}CD *p = Head->next;do{printf("%d ", p->data);p = p->next;} while (p != Head->next);printf("\n");
}bool DeleteCD(CD *Head, DataType data)
{if (Head->next == NULL){printf("链表为空，无法删除\n");return false;}if (WhileAimCD(Head, data) == NULL){printf("删除失败，节点不存在\n");return false;}if (Head->next->next == Head->next){Head->next->next = NULL;Head->next->pre = NULL;Head->next = NULL;PfCD(Head);return true;}if (data == Head->next->data){CD *last = WhileCD(Head)->next;CD *del = Head->next;last->next = del->next;del->next->pre = last;Head->next = del->next;del->next = NULL;del->pre = NULL;PfCD(Head);return true;}if (data == WhileCD(Head)->next->data){CD *pre = WhileCD(Head);CD *del = pre->next;pre->next = Head->next;Head->next->pre = pre;del->next = NULL;del->pre = NULL;PfCD(Head);return true;}CD *p = WhileAimCD(Head, data);CD *del = p->next;p->next = del->next;del->next->pre = p;del->next = NULL;del->pre = NULL;PfCD(Head);return true;
}bool InsertCD(CD *Head, CD *p, DataType data, int ch)
{if (Head->next == NULL){Head->next = p;p->next = p;p->pre = p;PfCD(Head);return true;}if (WhileAimCD(Head, data) == NULL){printf("插入失败，目标节点不存在\n");return false;}if (Head->next->next == Head->next){Head->next->next = p;p->next = Head->next;p->pre = Head->next;Head->next->pre = p;PfCD(Head);return true;}if (data == Head->next->data && ch == 1){CD *last = WhileCD(Head)->next;CD *note = Head->next;last->next = p;p->next = note;note->pre = p;p->pre = last;Head->next = p;PfCD(Head);return true;}if (data == Head->next->data && ch == 2){CD *note = Head->next;p->next = note->next;note->next->pre = p;note->next = p;p->pre = note;PfCD(Head);return true;}if (data == WhileCD(Head)->next->data && ch == 1){CD *pr = WhileCD(Head);p->next = pr->next;pr->next->pre = p;pr->next = p;p->pre = pr;PfCD(Head);return true;}if (data == WhileCD(Head)->next->data && ch == 2){CD *pr = WhileCD(Head)->next;p->next = Head->next;Head->next->pre = p;pr->next = p;p->pre = pr;PfCD(Head);return true;}if (ch == 1){CD *pl = WhileAimCD(Head, data);p->next = pl->next;pl->next->pre = p;pl->next = p;p->pre = pl;PfCD(Head);return true;}if (ch == 2){CD *pr = WhileAimCD(Head, data)->next;p->next = pr->next;pr->next->pre = p;pr->next = p;p->pre = pr;PfCD(Head);return true;}return false;
}int main()
{CD *Head = HeadCD();while (1){printf("请选择操作：1插入 2删除\n");int num;scanf("%d", &num);if (num == 1){printf("输入新节点数据：");DataType data1;scanf("%d", &data1);CD *p = SigleCD(data1);printf("在哪个数据附近插入：");DataType data2;scanf("%d", &data2);printf("前插输入1，后插输入2：");int ch;scanf("%d", &ch);InsertCD(Head, p, data2, ch);}else if (num == 2){printf("输入要删除的数据：");DataType data;scanf("%d", &data);DeleteCD(Head, data);}printf("\n");}
}