From 5e37dcf0dc5df78db265515d4f4f2f41292278b9 Mon Sep 17 00:00:00 2001
From: ViolentAyang <76544389+ViolentAyang@users.noreply.github.com>
Date: Sat, 19 Mar 2022 22:16:58 +0800
Subject: [PATCH] =?UTF-8?q?Create=20=E9=A1=BA=E5=BA=8F=E6=A0=88=E7=9A=84?=
 =?UTF-8?q?=E5=85=B1=E4=BA=AB=E6=A0=88=E5=88=9D=E5=A7=8B=E5=8C=96.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 栈/顺序栈的共享栈初始化.c | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 栈/顺序栈的共享栈初始化.c

diff --git a/栈/顺序栈的共享栈初始化.c b/栈/顺序栈的共享栈初始化.c
new file mode 100644
index 0000000..8acc0b7
--- /dev/null
+++ b/栈/顺序栈的共享栈初始化.c
@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <stdlib.h> 
+#include <stdbool.h>
+#define MaxSize 10
+
+typedef struct{
+	int data[MaxSize];  //静态数组存放栈中元素
+	int top0;  //0号栈栈顶指针
+	int top1;  //1号栈栈顶指针
+}ShStack;
+
+//初始化栈
+void InitStack(ShStack *S){
+	S->top0 = -1;
+	S->top1 = MaxSize;
+}
+//栈满
+bool fillStack(ShStack S){
+	if(S.top0+1==S.top1){
+		return true;
+	}else{
+		return false;
+	}
+}
+
+int main(){
+	ShStack S;
+	InitStack(&S);
+	printf("%d",fillStack(S));
+	return 0;
+}