summaryrefslogtreecommitdiff
path: root/c/dataStructure/栈和队列//顺序栈/stack.c
diff options
context:
space:
mode:
Diffstat (limited to 'c/dataStructure/栈和队列/栈/顺序栈/stack.c')
-rwxr-xr-xc/dataStructure/栈和队列/栈/顺序栈/stack.c50
1 files changed, 50 insertions, 0 deletions
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