From c6bc541ab58363d783e60a007e80e9bf9e231fda Mon Sep 17 00:00:00 2001 From: garhve Date: Mon, 5 Dec 2022 19:43:39 +0800 Subject: initialize --- .../\351\241\272\345\272\217\346\240\210/stack.c" | 50 ++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100755 "c/dataStructure/\346\240\210\345\222\214\351\230\237\345\210\227/\346\240\210/\351\241\272\345\272\217\346\240\210/stack.c" (limited to 'c/dataStructure/栈和队列/栈/顺序栈/stack.c') diff --git "a/c/dataStructure/\346\240\210\345\222\214\351\230\237\345\210\227/\346\240\210/\351\241\272\345\272\217\346\240\210/stack.c" "b/c/dataStructure/\346\240\210\345\222\214\351\230\237\345\210\227/\346\240\210/\351\241\272\345\272\217\346\240\210/stack.c" new file mode 100755 index 0000000..b124e59 --- /dev/null +++ "b/c/dataStructure/\346\240\210\345\222\214\351\230\237\345\210\227/\346\240\210/\351\241\272\345\272\217\346\240\210/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 -- cgit v1.2.3-70-g09d2