https://ac.nowcoder.com/acm/contest/3005/B
括号匹配问题,栈走一遍
#include <bits/stdc++.h>
#define mem(a, b) memset(a, b, sizeof a)
#pragma warning (disable:4996)
#pragma warning (disable:6031)
using namespace std;
const int N = 1e6 + 10;
char s[N];
char st[N];
int top;
int main()
{
scanf("%s", s);
bool f = 1;
top = 0;
int len = strlen(s);
for (int i = 0; i < len; i++) {
if (s[i] == '(' || s[i] == '[' || s[i] == '{') {
st[++top] = s[i];
}
else {
if (s[i] == ')') {
if (st[top] != '(') {
f = 0;
break;
}
else --top;
}
else if (s[i] == ']') {
if (st[top] != '[') {
f = 0;
break;
}
else top--;
}
else if (s[i] == '}') {
if (st[top] != '{') {
f = 0;
break;
}
else top--;
}
}
}
if (f) {
if (top == 0)puts("Yes");
else puts("No");
}
else puts("No");
return 0;
}