#include<iostream>
#include<cstdlib>
#include<malloc.h>
#include<stdio.h>
using namespace std;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define STACK_INIT_SIZE 100///存储空间初始分配量
#define STACKINCREMENT 10///存储空间分配增量
typedef int SElemType;
typedef struct {
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
///创建一个空栈
void InitStack(SqStack &S){
S.base = (SElemType *) malloc(STACK_INIT_SIZE * sizeof(SElemType));
//S.base = NULL;
if(!S.base) exit(OVERFLOW);
S.top = S.base;
S.stacksize = STACK_INIT_SIZE;
}
///销毁栈
void DestoryStack(SqStack &S){
S.top = S.base;
free(S.base);
return;
}
///清理栈
void ClearStack(SqStack &S){
S.top = S.base;
}
///判断栈是否为空
int StackEmpty(SqStack S){
if(S.base == S.top)return FALSE;
return TRUE;
}
///返回栈的长度
int StackLength(SqStack S){
return S.top-S.base;
}
///得到栈顶元素并由e返回
int GetTop(SqStack &S,SElemType &e){
if(S.top == S.base) return ERROR;
e = *(S.top - 1);
cout<<e<<endl;
return OK;
}
///插入元素e为新的栈顶元素
int Push(SqStack &S, SElemType &e){
if(S.top - S.base >= S.stacksize){
S.base = (SElemType *)realloc
(S.base,(S.stacksize +STACKINCREMENT)*sizeof(SElemType));
if(!S.base)exit(OVERFLOW);
S.top = S.base + S.stacksize;
S.stacksize += STACKINCREMENT;
}
*S.top++=e;
return OK;
}
///若栈顶不空,则删除S的栈顶元素,用e返回。并返回OK,否则返回ERROR
int Pop(SqStack &S,SElemType &e){
if(S.top == S.base) return ERROR;
e = *--S.top;
return OK;
}
///依次调用visit()
void StackTraverse(SqStack S,void (*visit)(SqStack S)){
visit(S);
}
void visit(SqStack S){
while(S.top!=S.base){
cout<<*--S.top<<" " ;
}
}
int main(){
SqStack S;
InitStack(S);
int a;
int e;
cout<<"输入:"<<endl;
cin>>a;
while(a != -1){
Push(S,a);
cout<<"输入:"<<endl;
cin>>a;
}
GetTop(S,e);
StackTraverse(S,visit);
cout<<"栈顶元素: "<<e<<endl;
cout<<"栈长:"<<StackLength(S);
}