栈的基本操作.doc

#include #include #define OK 1#define ERROR 0#define STACK_INIT_SIZE 100 / 存储空间初始分配量#define STACKINCREMENT 10 / 存储空间分配增量typedef int SElemType; / 定义栈元素类型typedef int Status; / Status是函数的类型,其返回值是函数结果状态代码，如OK等struct SqStackSElemType *base; / 在栈构造之前和销毁之后，base的值为NULLSElemType *top; / 栈顶指针int stacksize; / 当前已分配的存储空间，以元素为单位; / 顺序栈Status InitStack(SqStack &S) / 构造一个空栈S，该栈预定义大小为STACK_INIT_SIZE S.base=(SElemType * )malloc(STACK_INIT_SIZE *sizeof(SElemType);if(!S.base) return ERROR;S.top=S.base; S.stacksize=STACK_INIT_SIZE;return OK;Status Push(SqStack &S,SElemType e) / 在栈S中插入元素e为新的栈顶元素if(S.top-S.base=S.stacksize) S.base=(SElemType *)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(SElemType);if(!S.base) return ERROR;S.top=S.base+S.stacksize;S.stacksize+=STACKINCREMENT;* S.top+=e;return OK;Status Pop(SqStack &S,SElemType &e) / 若栈不空，则删除S的栈顶元素，用e返回其值，并返回OK；否则返回ERROR if(S.top=S.base) return ERROR;e=* -S.top;return OK;Status GetTop(SqStack S,SElemType &e) / 若栈不空，则用e返回S的栈顶元素，并返回OK；否则返回ERROR if(S.top=S.base) return ERROR; e=* (S.top-1);return OK;int StackLength(SqStack S) int i; / 返回栈S的元素个数if(S.top=S.base) i=0;elsefor(i=0;S.base=S.base) /请填空printf(%d , *p);p-; /请填空printf(n);return OK;int main()int quit=0;SqStack S;SElemType x, e;if( InitStack(S) ) / 判断顺序表是否创建成功，请填空printf(A Stack Has Created.n);while(!quit) int a;printf(1:Push n2:Pop n3:Get the Top n4:Return the Length of the Stackn5:Load the Stackn0:ExitnPlease choose:n);scanf(%d,&a);switch(a)case 1:printf(请输入入栈的值);scanf(%d, &x);if(!Push(S,x)printf(Push Error!n); / 判断Push是否合法，请填空else printf(The Element %d is Successfully Pushed!n, x); break;case 2: if(!Pop(S,e)printf(Pop Error!n); / 判断Pop是否合法，请填空else printf(The Element %d is Successfully Poped!n, e);break;case 3:if(!GetTop(S,e)printf(Get Top Error!n); / 判断Get Top是否合法，请填空else printf(The Top Element is %d!n, e);break;case 4:printf(The Length of the Stack is