Description
给你一串字符,不超过50个字符,可能包括括号、数字、字母、标点符号、空格,你的任务是检查这一串字符中的( ) ,[ ],{ }是否匹配。
Input
输入数据有多组,处理到文件结束。
Output
如果匹配就输出“yes”,不匹配输出“no”
Sample
Input
sin(20+10)
{[}]
Output
yes
no
#include<bits/stdc++.h>
using namespace std;
#define intsize 100000
#define addsize 100000
typedef char elemtype;
typedef struct
{
elemtype *base;
elemtype *top;
int stacksize;
} Sqstack;
int initstack(Sqstack &s)
{
s.base = (elemtype *)malloc(intsize *sizeof(elemtype));
if(!s.base)
return -1;
s.top = s.base;
s.stacksize = intsize;
return 0;
}
int bian(elemtype n)
{
int flag;
if(n == '(')
flag = 1;
if(n == '[')
flag = 2;
if(n == '{')
flag = 3;
if(n == ')')
flag = 4;
if(n == ']')
flag = 5;
if(n == '}')
flag = 6;
return flag;
}
int push(Sqstack &s, int x)
{
if(s.top - s.base > s.stacksize)
{
s.base = new elemtype[intsize + addsize];
if(!s.base)
return -1;
s.top = s.base + addsize;
s.stacksize += addsize;
}
*s.top++ = x;
return 0;
}
elemtype pop(Sqstack &s)
{
elemtype x;
return x = *--s.top;
}
int main()
{
Sqstack s;
char a[55], ch;
int n, flag;
while(gets(a))
{
initstack(s);
flag = 1;
n = strlen(a);
for(int i = 0; i < n; i++)
{
ch = a[i];
if(ch == '(' || ch == '[' || ch == '{')
push(s, bian(ch));
else if(ch == ')' || ch == ']' || ch == '}')
{
if(s.top == s.base)
{
flag = 0;
break;
}
else if(bian(ch) - pop(s) != 3) {
flag = 0;
break;
}
}
}
if(s.top != s.base)//判断是否全部匹配
flag = 0;
if(flag)
printf("yes\n");
else
printf("no\n");
}
return 0;
}