blob: b124e59534eb8f9b0717eba2bb2f4ec6abc65620 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
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;
}
|
