学步园

头文件：

sqstack.h

/*<br /> * sqstack.h<br /> */<br /> #ifndef SQSTACK_H_<br /> #define SQSTACK_H_<br /> #define OK 1<br /> #define ERROR -1<br /> #define MAXSZ 50<br /> typedef char ElemType;<br /> typedef struct<br /> {<br /> ElemType elem[MAXSZ];<br /> int top;<br /> } sqstack;<br /> int InitStack(sqstack *s);<br /> int Push(sqstack *s, const ElemType e);<br /> int Pop(sqstack *s);<br /> int StackLength(const sqstack *s);<br /> int StackEmpty(const sqstack *s);<br /> ElemType GetTop(sqstack *s);<br /> int PrintStack(const sqstack *s);<br /> #endif /* SQSTACK_H_ */<br />

代码文件:

sqstack.c

/*<br /> * sqstack.c<br /> */<br /> #include <stdio.h><br /> #include <stdlib.h><br /> #include "sqstack.h"<br /> int InitStack(sqstack *s)<br /> {<br /> if (NULL == s)<br /> {<br /> printf("ERROR: The stack is NULL!/n");<br /> return ERROR;<br /> }<br /> s->top = -1;<br /> return OK;<br /> }<br /> int Push(sqstack *s, const ElemType e)<br /> {<br /> if (MAXSZ - 1 == s->top)<br /> {<br /> printf("ERROR: The stack is full!/n");<br /> return ERROR;<br /> }<br /> s->top++;<br /> s->elem[s->top] = e;<br /> return OK;<br /> }<br /> int Pop(sqstack *s)<br /> {<br /> if (-1 == s->top)<br /> {<br /> printf("ERROR: The stack is empty!/n");<br /> return ERROR;<br /> }<br /> s->top--;<br /> return OK;<br /> }<br /> int StackLength(const sqstack *s)<br /> {<br /> if (NULL == s)<br /> {<br /> printf("ERROR: The stack is NULL!/n");<br /> return ERROR;<br /> }<br /> return s->top + 1;<br /> }<br /> int StackEmpty(const sqstack *s)<br /> {<br /> if (NULL == s)<br /> {<br /> printf("ERROR: The stack is NULL!/n");<br /> return ERROR;<br /> }<br /> return (-1 == s->top);<br /> }<br /> ElemType GetTop(sqstack *s)<br /> {<br /> if (StackEmpty(s))<br /> {<br /> printf("ERROR: The stack is empty!/n");<br /> return '/0';<br /> }<br /> return s->elem[s->top];<br /> }<br /> int PrintStack(const sqstack *s)<br /> {<br /> if (NULL == s)<br /> {<br /> printf("ERROR: The stack is NULL!/n");<br /> return ERROR;<br /> }<br /> printf("===============/n");<br /> int i;<br /> for (i = s->top; i > -1; --i)<br /> {<br /> printf("%c", s->elem[i]);<br /> }<br /> printf("/n");<br /> printf("===============/n");<br /> return OK;<br /> }<br />

main函数文件：

SeqStack.c

/*<br /> ============================================================================<br /> Name : SeqStack.c<br /> Author :<br /> Version :<br /> Copyright : Copyright@DK<br /> Description : Hello World in C, Ansi-style<br /> ============================================================================<br /> */<br /> #include <stdio.h><br /> #include <stdlib.h><br /> #include "sqstack.h"<br /> int main(void)<br /> {<br /> sqstack s;<br /> InitStack(&s);<br /> Push(&s,'o');<br /> Push(&s,'l');<br /> Push(&s,'l');<br /> Push(&s,'e');<br /> Push(&s,'h');<br /> PrintStack(&s);<br /> printf("The length is %d/n",StackLength(&s));<br /> Pop(&s);<br /> Pop(&s);<br /> printf("%c/n", GetTop(&s));<br /> PrintStack(&s);<br /> Pop(&s);<br /> Pop(&s);<br /> Pop(&s);<br /> Pop(&s);<br /> Push(&s, '1');<br /> PrintStack(&s);<br /> return EXIT_SUCCESS;<br /> }<br />