From c59b86f06cfa2295c8a2cd77d0f1251a42c5bdc7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=83=91=E9=92=B0=E7=90=B0?=
 <13453587+xiaohei0126@user.noreply.gitee.com>
Date: Fri, 8 Dec 2023 08:01:55 +0000
Subject: [PATCH] ex3.1.cpp
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: 郑钰琰 <13453587+xiaohei0126@user.noreply.gitee.com>
---
 2209040075/chapter3/ex3.1.cpp | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 2209040075/chapter3/ex3.1.cpp

diff --git a/2209040075/chapter3/ex3.1.cpp b/2209040075/chapter3/ex3.1.cpp
new file mode 100644
index 00000000..b1674e3e
--- /dev/null
+++ b/2209040075/chapter3/ex3.1.cpp
@@ -0,0 +1,26 @@
+#include"sqstack.cpp"
+int main(){
+	ElemType e;
+	Sqstack *s;
+	printf("顺序栈s的基本运算如下:\n");
+	printf("(1)初始化栈s\n");
+	Initstack(s);
+	printf("(2)栈为%s\n",(StackEmpty(s)?"空":"非空"));
+	printf("(3)依次进栈元素a,b,c,d,e\n");
+	push(s,'a'); 
+	push(s,'b'); 
+	push(s,'c'); 
+	push(s,'d'); 
+	push(s,'e');
+	printf("(4)栈为%s\n",(StackEmpty(s)?"空":"非空"));
+	printf("(5)出栈序列:");
+	while(!StackEmpty(s)){
+		pop(s,e);
+		printf("%c",e);
+	} 
+	printf("\n");
+	printf("(6)栈为%s\n",(StackEmpty(s)?"空":"非空"));
+	printf("(7)释放栈\n");
+	destroystack(s);
+	return 1; 
+} 
-- 
Gitee