第5周实践项目1 顺序栈建立的算法库

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;}
sqstack.h#include <stdio.h>#define MaxSize 100typedef char Elemtype;typedef struct{    Elemtype date[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);  //输出栈
sqstack.h#include <stdio.h>#include <malloc.h>#include "sqstack.h"void InitStack(SqStack *&s){    s=(SqStack *)malloc(sizeof(SqStack));    s->top=-1;}void DestroyStack(SqStack *&s){    free(s);}int StackLength(SqStack *s){    return s->top+1;}bool StackEmpty(SqStack *s){    return s->top==-1;//在这儿s->top 用==判断不能用=}bool Push(SqStack *&s,Elemtype e){    if(s->top==MaxSize-1)        return false;        //s->top++;    s->date[++s->top]=e;    return true;}bool Pop(SqStack *&s,Elemtype &e){    if(s->top==-1)        return false;    e=s->date[s->top--];    //s->top--;    return true;}bool GetTop(SqStack *s,Elemtype &e){    if(s->top==-1)        return false;    e=s->date[s->top];    return true;}void DispStack(SqStack *s){    int i;    for(i=s->top;i>-1;--i)    printf("%c",s->date[i]);    printf("\n");}