c语言实现括号匹配的检验问题
#include<stdio.h>
#define maxsize 8
int match()
{
int stack[maxsize];
int top=-1;
char str[256];
gets(str);
int i=0;
while(str[i]!=’\0’)
{
if(str[i]=’(’ || str[i]=’{’ || str[i]=’[’)
{
stack[++top]=str[i];//如果有其中一种括号,压入栈中
}
else if(str[i]=’)’ || str[i]=’}’ || str[i]=’]’)
{
if(top=-1)
printf(“false\n”);//栈中没有东西与之对应,错误
if(str[i]=’)’&&stack[top]=’(’ || str[i]=’}’&&stack[top]=’{’ || str[i]=’]’&&stack[top]=’[’){stack[top–]}//栈中有与之对应的括号,出栈
else
printf(“false\n”);
}
if(top=-1)
printf(“true\n”);
else printf(“false\n”);
}
}
int main(){
match();
return 0;
}