3 files changed, 94 insertions, 0 deletions
diff --git a/c/dataStructure/栈和队列/栈/顺序栈/main.c b/c/dataStructure/栈和队列/栈/顺序栈/main.c
new file mode 100755
index 0000000..93fcad8
--- /dev/null
+++ b/c/dataStructure/栈和队列/栈/顺序栈/main.c
@@ -0,0 +1,21 @@
+#include "stack.h"
+
+int main(void) {
+    int p;
+    Stack s;
+
+    InitStack(&s);
+
+    for (int i = 0; i < 8; i++)
+        Push(&s,i);
+    
+    for (int i = 0; i < 8; i++) {
+        printf("Get top: %d\n",GetTop(&s));
+        Pop(&s,&p);
+        printf("Pop: %d\n",p);
+    }
+
+    DestroyStack(&s);
+    
+    return 0;
+}
+\ No newline at end of file
diff --git a/c/dataStructure/栈和队列/栈/顺序栈/stack.c b/c/dataStructure/栈和队列/栈/顺序栈/stack.c
new file mode 100755
index 0000000..b124e59
--- /dev/null
+++ b/c/dataStructure/栈和队列/栈/顺序栈/stack.c
@@ -0,0 +1,50 @@
+#include "stack.h"
+
+bool InitStack(Stack * s) {
+    s->base = (int *) malloc (sizeof(int) * MAXIMUM);
+
+    if (!s->base) {
+        fprintf(stderr,"Create stack error!\n");
+        return false;
+    }
+    s->top = s->base;
+    s->size = MAXIMUM;
+    
+    return true;
+}
+
+bool DestroyStack(Stack * s) {
+    if (!s->base){
+        fprintf(stderr,"Stack not initialize!\n");
+        return false;
+    }
+    free(s->base);
+
+    return true;
+}
+
+bool Push(Stack * s, int n) {
+    if (s->top - s->base == s->size) {
+        fprintf(stderr,"Stack is full!\n");
+        return false;
+    }
+    *s->top++ = n;  // *s->top = n; *s->top++;
+
+    return true;
+}
+
+bool Pop(Stack * s, int * n) {
+    if (s->top == s->base) {
+        fprintf(stderr,"Empty stack!\n");
+        return false;
+    }
+    *n = *--s->top; // --s->top; *n = *s->top;
+
+    return true;
+}
+
+int GetTop(Stack * s) {
+    if (s->top != s->base)
+        return *(s->top - 1);
+    return -1;
+}
+\ No newline at end of file
diff --git a/c/dataStructure/栈和队列/栈/顺序栈/stack.h b/c/dataStructure/栈和队列/栈/顺序栈/stack.h
new file mode 100755
index 0000000..2d63452
--- /dev/null
+++ b/c/dataStructure/栈和队列/栈/顺序栈/stack.h
@@ -0,0 +1,23 @@
+#ifndef _STACK_H
+#define _STACK_H
+
+#include<stdio.h>
+#include<stdlib.h>
+#include<stdbool.h>
+
+#define MAXIMUM 5
+#define RESIZE 1
+
+typedef struct stack {
+    int * base;
+    int * top;
+    int size;
+} Stack;
+
+bool InitStack(Stack * s);
+bool DestroyStack(Stack * s);
+bool Push(Stack * s, int n);
+bool Pop(Stack * s, int * n);
+int  GetTop(Stack * s);
+
+#endif
+\ No newline at end of file