commit cb6320a8f665b559002599d1908c9b70b464d3c0
Author: SCHOOL <SCHOOL@serversalem.top>
Date:   Thu Sep 3 22:55:03 2026 +0800

    用 C 实现可扩容的顺序栈（数组 + 动态扩容）

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..9b8a57b
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,9 @@
+# 编译产物
+*.exe
+*.o
+
+# 本地笔记（仓库是 public，不提交）
+CLAUDE.md
+
+# 编辑器/机器相关配置
+.vscode/
diff --git a/1.c b/1.c
new file mode 100644
index 0000000..df4ade7
--- /dev/null
+++ b/1.c
@@ -0,0 +1,118 @@
+#include<stdio.h>
+#include<string.h>
+#include<malloc.h>
+#include<stdlib.h>
+
+
+
+typedef  struct
+{
+    /* data */
+    int length;//��ʼĬ�����鳤�ȣ�������������ͬ������
+    int add;//��λ������ʱ��һ�����ӵĸ���
+    int top;//��ǰ�����λ��
+    int *start;//��ʼλ�õ�ָ�룬��ʦ�Ͽ�д����Ҳ��֪��Ϊʲô
+
+}zhan;
+
+
+
+int zadd(zhan *z,int x);
+void zinit(zhan *z);
+int zreduce(zhan *z,int *a);
+void zfree(zhan *z);
+
+int main (){
+zhan z;
+int a;
+int num;
+zinit(&z);
+printf("Ҫ������ٸ�������");
+scanf("%d",&num);
+for(int i=0;i<num;i++){
+scanf("%d",&a);
+zadd(&z,a);
+}
+
+printf("���ȫ������\n");  //�������
+for(int i=0;i<(z.top);i++){
+printf("%d",z.start[i]);
+}
+
+
+
+ printf("���ڿ�ʼ��ջ\n");
+// int b;
+// int c=zreduce(&z,&b);
+// if(!c){
+// printf("%d",b);
+// }
+// c=zreduce(&z,&b);
+// if(!c){
+// printf("%d",b);
+// }
+
+
+//��ջ
+while (z.top!=0)
+{
+    /* code */
+int b;
+int c=zreduce(&z,&b);
+if(!c){
+ printf("%d",b);
+ }
+
+}
+
+
+
+printf("����111");
+zfree(&z);
+printf("����222");
+    return 0;
+}
+
+
+int zadd(zhan *z,int x){    //��ջ��������µ�Ԫ��
+    //��ô�ӣ�    �ȿ���û�����˾��������ټӡ�û����ֱ�Ӽ���ȥ��Ȼ��top+1  
+    if(z->top==z->length){
+        z->start=(int*)realloc(z->start,(z->length+z->add)*sizeof(int));
+        z->length=z->length+z->add;
+    }
+    z->start[z->top]=x;
+    z->top++;
+
+
+
+return 1;
+}
+
+void zinit(zhan *z){  //����ջ   Ҫ����ɶ�أ��Ͷ���zhan�Ķ�������һ����
+z->add=2;
+z->top=0;
+z->length=10;  //���ڶ�����ˣ�Ҫ�����ڴ�
+z->start=(int*)malloc((z->length)*sizeof(int));
+
+
+
+}
+
+int zreduce(zhan *z,int *a){   //ʵ���ó�ȥ���ݡ����� ��ΪҪ�����ݴ��ţ�Ҫô return ��Ҫô��ָ��
+if(z->top==0){
+    printf("û�����ˣ�Ҫ����");
+    return 1 ;
+}
+
+    z->top--;
+*a=z->start[z->top];
+return 0;
+
+}
+
+void zfree(zhan *z){
+free(z->start);
+
+}
+
+