文档介绍：编写一个程序,实现顺序栈的各种基本运算,并在基础上完成以下功能:
初始化顺序栈;
判断顺序栈是否为空;
依次进栈元素1,2,3,4,5;
判断顺序栈是否为空;
输出栈长度;
输出从栈顶到栈底的元素;
读出栈顶元素;
删除栈顶元素;
输出从栈顶到栈底的元素;
判断顺序栈是否为空;
释放栈。
代码如下:
#include<>
#include<>
#include<>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define Null 0
#define MaxSize 50
typedef char SElemType;
typedef int Status;
typedef struct{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
Status InitStack(SqStack &S){
=(SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!)exit(OVERFLOW);
=;
=STACK_INIT_SIZE;
return OK;
}
Status DestroyStack(SqStack &S){
free();
=Null;
=Null;
=Null;
return OK;
}
Status StackEmpty(SqStack S){
if(==)return TRUE;
else return FALSE;
}
int StackLength(SqStack S){
return -;
}
Status GetTop(SqStack S,SElemType &e){
if(==) return ERROR;
e=*(-1);
return OK;
}
Status Push(SqStack &S,SElemType e){
if(->=){
=(SElemType *)realloc(,
(+STACKINCREMENT)*sizeof(SElemType));
if(!)exit(OVERFLOW);
=+;
+=STACKINCREMENT;
}
*++=e;
return OK;
}
Status Pop(SqStack &S,SElemType &e){
if(==)return ERROR;
e=*--;
return OK;
}
int StackTraverse(SqStack S,Status(*visit)(SElemType)){
while(>)
visit(*++);
printf("\n");
return OK;
}
int visit(SElemType e){
printf("%d ",e);
return OK;
}
int main(){
SqStack S;
SElemType e;
printf("构造一个空栈\n");
InitStack(S);
printf("栈是否为空:");
if(StackEmpty(S)){
printf("该栈为空\n");
}
else{
printf("该栈不为空\n");
}
printf("依次插入元素1,2,3,4\n");
Push(S,1);
Push(S,2);
Push(S,3);
Push(S,4);
printf("现在的栈为:");
StackTraverse(S,visit);
printf("栈的长度是%d\