03.顺序栈的简单案例_栈简单案例

#include<stdio.h>
#include<stdlib.h>

#define MAXSIZE 20
#define OK 1
#define ERROR 0
#define OVERFLOW -2

typedef char ElemType;
typedef int Status;

//顺序栈的存储结构
typedef struct {
    ElemType *base;
    ElemType *top;
    int stackSize;
} sqStack;

//栈的初始化
Status InitStack(sqStack *s) {
    s->base = new ElemType[MAXSIZE];
    if (!s->base) {
        exit(OVERFLOW);
    }
    s->top = s->base;
    s->stackSize = MAXSIZE;
    return OK;
}

//入栈
Status Push(sqStack *s, ElemType e) {
    if (s->top - s->base == s->stackSize) {
        return ERROR;
    }
    *(s->top) = e;
    s->top++;
    return OK;
}

//出栈
Status Pop(sqStack *s, ElemType *e) {
    if (s->top == s->base) {
        return ERROR;
    }
    *e = *--(s->top);
    return OK;
}

//返回栈的容量
Status StackLen(sqStack s) {
    return (s.top - s.base);
    //不是地址的相减而是内容
}

void OutPut(){
    ElemType c;
    sqStack s;
    Status len = 0;
    InitStack(&s);
    printf("请输入整数，输入#符号表示结束！\n");
    scanf("%c", &c);
    while (c != '#') {
        Push(&s, c);
        scanf("%c", &c);
    }
    //清理键盘缓冲区 回车的ASCII=10
    //若用 cin，cout则不用这样
    getchar();
    len = StackLen(s);
    printf("栈的当前容量是：%d\n", len);
}
int main() {
    OutPut();
    return 0;
}
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75