第四次实验，栈

C程序设计 第五版 谭浩强 著作 

以下是程序

#include <stdio.h>

#include <malloc.h>

#define MaxSize 100

typedef char ElemType;

typedef struct

{

ElemType data[MaxSize];

int top;

} SqStack;

void lnitStack(SqStack *&s)

{

s=(SqStack *)malloc(sizeof(SqStack));

s->top=-1;

}

void ClearStack(SqStack *&s)

{

free(s);

}

int StackLength(SqStack *s)

{

return(s->top+1);

}

int StackEmpty(SqStack *s)

{

return(s->top==-1);

}

int Push(SqStack *&s,ElemType e)

{

if (s->top==MaxSize-1)

return 0;

s->top++;

s->data[s->top]=e;

return 1;

}

int pop(SqStack *&s,ElemType &e)

{

if (s->top==-1)

return 0;

e=s->data[s->top];

s->top--;

return 1;

}

int GetTop(SqStack *s,ElemType &e)

{

   if (s->top==-1)

   return 0;

   e=s->data[s->top];

   return 1;

}

void DispStack(SqStack *s)

{

int i;

for (i=s->top;i>=0;i--)

printf("%c",s->data[i]);

printf("");

}

int main()

{

ElemType e;

SqStack *s;

printf("(1)初始化栈s");

lnitStack(s);

printf("(2)栈为%s",(StackEmpty(s)?"空":"非空"));

printf("(3)依次进栈元素a,b,c,d,e");

Push(s,'a');

Push(s,'b');

Push(s,'C');

Push(s,'D');

Push(s,'E');

printf("(4)栈为%s",(StackEmpty(s)?"空":"非空"));

printf("(5)栈长度:%d",StackLength(s));

printf("(6)从栈顶到栈底元素:");DispStack(s);

printf("(7)出栈序列:");

while (!StackEmpty(s))

{

pop(s,e);

printf("%c",e);

}

printf("");

printf("(8)栈为%s",(StackEmpty(s)?"空":"非空"));

printf("(9)释放栈");

ClearStack(s);

}