第五周项目一
来源:互联网 发布:苹果手机估价淘宝 编辑:程序博客网 时间:2024/05/16 19:10
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- main:
-
-
- #include <stdio.h>
- #include "stlist.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;
- }
-
-
-
- stlist.cpp:
-
- #include <stdio.h>
- #include <malloc.h>
- #include "stlist.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);
- }
- 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];
- return true;
- }
-
- void DispStack(SqStack *s)
- {
- int i;
- for (i=s->top;i>=0;i--)
- printf("%c ",s->data[i]);
- printf("\n");
- }
-
-
-
-
- stlist.h:
-
- #define MaxSize 100
- typedef 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);
运行结果:
知识点总结:需考虑栈上溢出和栈下溢出。
学习心得:学会了顺序栈的存储结构以及基本运算。