第五周——项目一 自建算法库 “顺序栈”

/*烟台大学计算机学院  文件名称:sqstack 作者:董玉祥 完成日期: 2017 10 14 问题描述：建立顺序栈算法库 */代码：sqstack.h#define SQSTACK_H_INCLUDED#define MaxSize 100typedef char ElemType;typedef struct{    ElemType data[MaxSize];    int top;                //栈指针} SqStack;                  //顺序栈类型定义void InitStack(SqStack *&s);    //初始化栈void DestroyStack(SqStack *&s);  //销毁栈bool StackEmpty(SqStack *s);     //栈是否为空int StackLength(SqStack *s);  //返回栈中元素个数——栈长度bool Push(SqStack *&s,ElemType e); //入栈bool Pop(SqStack *&s,ElemType &e); //出栈bool GetTop(SqStack *s,ElemType &e); //取栈顶数据元素void DispStack(SqStack *s);  //输出栈#endif // SQSTACK_H_INCLUDEDsqstack.cpp#include <stdio.h>#include "sqstack.h"#include <malloc.h>void InitStack(SqStack *&s){  s=(SqStack *)malloc(sizeof(SqStack));  s->top=-1;}void DestroyStack(SqStack *&s){    free(s);}bool StackEmpty(SqStack *s){    return (s->top==-1);}int StackLength(SqStack *s){    return (s->top+1);}bool Push(SqStack *&s,ElemType e){    if(s->top==MaxSize-1)        return false;    s->top++;    s->data[s->top]=e;    return true;}bool Pop(SqStack *&s,ElemType &e){    if(s->top==-1)        return false;    e=s->data[s->top];    s->top--;    return true;}bool GetTop(SqStack *s,ElemType e){    if(s->top==-1)        return false;    e=s->data[s->top];    s->top--;    return true;}void DispStack(SqStack *s){    int i;    for(i=s->top;i>=0;i--)        printf("%c",s->data[s->top]);    printf("\n");}main.cpp#include <stdio.h>#include "sqstack.h"int main(){    ElemType e;    SqStack *s;    printf("(1)初始化栈s\n");    InitStack(s);    printf("(2)栈为%s\n",(StackEmpty(s)?"空":"非空"));    printf("(3)依次进栈元素a,b,c,d,e\n");    Push(s,'a');    Push(s,'b');    Push(s,'c');    Push(s,'d');    Push(s,'e');    printf("(4)栈为%s\n",(StackEmpty(s)?"空":"非空"));    printf("(5)栈长度:%d\n",StackLength(s));    printf("(6)从栈顶到栈底元素:");DispStack(s);    printf("(7)出栈序列:");    while (!StackEmpty(s))    {        Pop(s,e);        printf("%c ",e);    }    printf("\n");    printf("(8)栈为%s\n",(StackEmpty(s)?"空":"非空"));    printf("(9)释放栈\n");    DestroyStack(s);    return 0;}运行结果截图：