(基于C语言的数据结构)顺序栈的基本操作和简单习题(数值转换、括号匹配)持续更新中
stack.h
#include <stdio.h>
#include <stdlib.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OK 1;
#define FALSE -1;
typedef int SElemType;
typedef struct {
SElemType *top;
SElemType *base;
int stacksize;
}SqStack;
int InitStack(SqStack &S);
int DestroyStack(SqStack &S);
int ClearStack(SqStack &S);
int EmptyStack(SqStack S);
int LengthStack(SqStack S);
int GetTop(SqStack S);
int Push(SqStack &S, SElemType e);
int Pop(SqStack &S, SElemType &e);
int visit(SqStack S);