break;
case 3:
if (StackEmpty(S))
{
cout << "栈空" << endl;
}
else
{
cout << "栈未空" << endl;
}
break;
case 4:
GetTop(S, e);
cout << "e is " << e << endl;
break;
case 5:
StackLength(S);
break;
case 0:break;
}
}
DestroyStack(S);
return OK;
}
//SStack.cpp:
#include"SStack.h"
//输出菜单
void Muse()
{
cout << "请选择功能：" << endl;
cout << " 1.入栈" << endl;
cout << " 2.出栈" << endl;
cout << " 3.判栈空" << endl;
cout << " 4.返回栈顶部数据" << endl;
cout << " 5.栈长" << endl;
cout << " 0.退出系统" << endl;
cout << "你的选择是：" ;
}
//创建栈
Status InitStack(SqStack &S)
{
S.base = (SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if (!S.base) exit(ERROR);
S.top = S.base;
S.stacksize = STACK_INIT_SIZE;
return OK;
}
//得到顶部数据
Status GetTop(SqStack S, SElemType &e)
{
if (S.base == S.top) return ERROR;
e = *(S.top - 1);
return OK;
}
//入栈
Status Push(SqStack &S, SElemType &e)
{
if (S.top - S.base >= STACK_INIT_SIZE)
{
S.base = (SElemType *)realloc(S.base, (STACK_INIT_SIZE + STACKINCREMENT) * sizeof(SElemType));
if (!S.base) exit(ERROR);
S.top = S.base + S.stacksize;
S.stacksize += STACKINCREMENT;
}
*S.top++ = e;
return OK;
}
//出栈
Status Pop(SqStack &S, SElemType &e) {
if (S.base == S.top)
{
return ERROR;
}
e = *--S.top;
cout<<"pop succeed"<return OK;
}
//判栈空
Status StackEmpty(SqStack S)
{
if (S.top == S.base)
{
return ERROR;
