From 019d49f12ab3a58e3ad2b6fc7abac4551e977361 Mon Sep 17 00:00:00 2001
From: ViolentAyang <76544389+ViolentAyang@users.noreply.github.com>
Date: Tue, 8 Mar 2022 19:23:00 +0800
Subject: [PATCH] =?UTF-8?q?Create=20=E5=88=9B=E5=BB=BA=E5=B8=A6=E5=A4=B4?=
 =?UTF-8?q?=E7=BB=93=E7=82=B9=E7=9A=84=E5=8D=95=E9=93=BE=E8=A1=A8.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 链表/创建带头结点的单链表.c | 36 ++++++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 链表/创建带头结点的单链表.c

diff --git a/链表/创建带头结点的单链表.c b/链表/创建带头结点的单链表.c
new file mode 100644
index 0000000..a4f0464
--- /dev/null
+++ b/链表/创建带头结点的单链表.c
@@ -0,0 +1,36 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<stdbool.h>
+
+typedef struct LNode{
+    int data;
+    struct LNode *next;
+}LNode,*LinkList;
+
+bool InitList(LinkList *L){
+    (*L) = (LNode*)malloc(sizeof(LNode));
+    if(*L==NULL){
+        return false;
+    }
+    (*L)->next = NULL;
+	return true;
+}
+
+bool Empty(LinkList L){
+    if(L->next==NULL){
+        return true;
+    }else{
+        return false;
+    }
+}
+
+int main(){
+	LinkList L;
+    InitList(&L);
+    if(Empty(L)){
+        printf("分配成功");
+    }else{
+        printf("分配失败");
+    }
+    return 0;
+}