/*设计算法判断一个算术表达式的圆括号是否正确配对*/
#include"stdio.h"
#include"malloc.h"
#define maxlen 100
typedef struct node{
char data[maxlen];
int top;
}SeqStack;
//建立空栈
SeqStack *SetStack (){
SeqStack *S;
S=(SeqStack*)malloc(sizeof(SeqStack));
S->top=-1;
return S;
}
//顺序栈置空算法
SeqStack *InintStack(SeqStack *S){
S->top = -1;
return S;
}
//判断栈空算法
int StackEmpty(SeqStack *S){
if(S->top>=0)
return 0;
else
&nb
#include"stdio.h"
#include"malloc.h"
#define maxlen 100
typedef struct node{
char data[maxlen];
int top;
}SeqStack;
//建立空栈
SeqStack *SetStack (){
SeqStack *S;
S=(SeqStack*)malloc(sizeof(SeqStack));
S->top=-1;
return S;
}
//顺序栈置空算法
SeqStack *InintStack(SeqStack *S){
S->top = -1;
return S;
}
//判断栈空算法
int StackEmpty(SeqStack *S){
if(S->top>=0)
return 0;
else
&nb