From c2f9e16260fd79819c06c8d6bca44b9e237a0382 Mon Sep 17 00:00:00 2001
From: ViolentAyang <76544389+ViolentAyang@users.noreply.github.com>
Date: Fri, 18 Mar 2022 19:43:05 +0800
Subject: [PATCH] =?UTF-8?q?Create=20=E5=8F=8C=E9=93=BE=E8=A1=A8=E7=9A=84?=
 =?UTF-8?q?=E5=88=A0=E9=99=A4.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 链表/双链表的删除.c | 41 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 链表/双链表的删除.c

diff --git a/链表/双链表的删除.c b/链表/双链表的删除.c
new file mode 100644
index 0000000..d130cfe
--- /dev/null
+++ b/链表/双链表的删除.c
@@ -0,0 +1,41 @@
+#include <stdio.h>
+#include <stdlib.h> 
+#include <stdbool.h>
+
+typedef struct DNode{
+	int data;
+	struct DNode *next,*prior;
+}DNode,*DLinkList;
+
+bool InitDlinkList(DLinkList L){
+	L = (DLinkList)malloc(sizeof(DNode));
+	if(L==NULL){
+		return false;
+	}
+	L->prior = NULL;
+	L->next =NULL;
+	return true;
+}
+
+bool DeleteNextNode(DNode *p){
+	if(!p){
+		return false;
+	}
+	DNode* q = p;
+	if(!q){
+		return false;
+	}
+	p->next = q->next;
+	if(q->next){
+		q->next->prior = p;
+	}
+	free(p);
+	return true;
+}
+
+int main()
+{
+	DLinkList L;
+	InitDlinkList(L);
+	return 0;
+}