代码:
1.头文件:sqstack.h,包含定义顺序栈数据结构的代码、宏定义、要实现算法的函数的声明;
- #ifndef SQSTACK_H_INCLUDED
- #define SQSTACK_H_INCLUDED
-
- #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);
-
- #endif // SQSTACK_H_INCLUDED
2.源文件:sqstack.cpp,包含实现各种算法的函数的定义
- #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);
- }
- 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");
- }
3.main.cpp完成测试
- #include <stdio.h>
- #include "sqstack.h"
- int main()
- {
- char c;
- char st[50];
- int d=1, i;
- SqStack *s;
- InitStack(s);
- printf("请输入表达式:");
- scanf("%s", st);
- for(i=0; st[i]!='\0'&&d; i++)
- {
- switch(st[i])
- {
- case'(':
- case'[':
- case'{':
- Push(s, st[i]);
- break;
- case')':
- Pop(s, c);
- if(c!='(') d=0;
- break;
- case']':
- Pop(s, c);
- if(c!='[') d=0;
- break;
- case'}':
- Pop(s,c);
- if(c!='{') d=0;
- break;
- }
- }
- if(StackEmpty(s)&&d==1)
- printf("配对正确!!\n");
- else
- printf("配对错误!!\n");
- return 0;
- }
运行结果: