#include
#define MaxSize 10
using namespace std;
typedef struct SqStack {
int data[MaxSize]; //静态数组存放栈中元素
int top; //栈顶指针
}SqStack;
//初始化栈
void InitStack(SqStack& S) {
S.top = -1;
}
//判断栈是否为空
bool StackEmpety(SqStack S) {
return(S.top == -1);
}
//新元素入栈
bool Push(SqStack& S,int x) {
if (S.top == MaxSize - 1)
return false;
S.top += 1;
S.data[S.top] = x;
return true;
}
//出栈操作
bool Pop(SqStack& S, int &x) {
if (S.top == -1)
return false;
x = S.data[S.top];
S.top -= 1;
return true;
}
也有top指针指向栈底的情况(top = 0),判断栈满的条件是top == MaxSize;
//共享栈
typedef struct ShStack {
int data[MaxSize];
int top0; //栈底指针
int top1; //栈顶指针
}ShStack;
//初始换共享栈
void InitStack(ShStack& S) {
S.top0 = -1;
S.top1 = MaxSize;
}
栈满的条件是 top0 +1 == top1