B - 数据结构实验之栈与队列四:括号匹配
Description
给你一串字符,不超过50个字符,可能包括括号、数字、字母、标点符号、空格,你的任务是检查这一串字符中的( ) ,[ ],{ }是否匹配。
Input
输入数据有多组,处理到文件结束。
Output
如果匹配就输出“yes”,不匹配输出“no”
Sample
Input
sin(20+10) {[}]
Output
yes no
#include <bits/stdc++.h>
#include <string>
const int maxn = 1e6 + 10;
const int inf = 0x3f3f3f3f;
using namespace std;
stack <int> s;
int main ()
{
string a;
int n;
while (getline(cin,a)) {
int flag = 1;
stack <int> s;
n = a.size();
for (int i = 0; i < n; i ++) {
if (a[i]=='['||a[i]=='{'||a[i]=='(')
s.push(a[i]);
else if (a[i]==']'||a[i]=='}'||a[i]==')') {
if (s.empty()) {
cout <<"no"<<endl;
flag = 0;
break;
}
else {
if ((a[i]==']'&&s.top()=='[')||(a[i]=='}'&&s.top()=='{')||(a[i]==')'&&s.top()=='('))
s.pop();
else {
cout <<"no"<<endl;
flag = 0;
break;
}
}
}
}
if (flag==1) {
if (s.empty()) {
cout <<"yes"<<endl;
}
else cout << "no" <<endl;
}
}
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int i, top, l;
char a[55], b[55];
while(gets(a))
{
top = 0;
l = strlen(a);
for(i = 0; i < l; i++)
{
if(a[i] == '(' || a[i] == '[' || a[i] == '{')
b[++top] = a[i];
if(a[i] == ')' || a[i] == ']' || a[i] == '}')
{
if((b[top] == '(' && a[i] == ')') || (b[top] == '[' && a[i] == ']') || (b[top] == '{' && a[i] == '}'))
top--;
else
break;
}
}
if(top == 0 && i == l)
printf("yes\n");
else
printf("no\n");
}
return 0;
}