习题6-1 平衡的括号 UVa673

1.题目描述：点击打开链接

2.解题思路：利用栈分类进行讨论即可。

3.代码：

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<cassert>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

const int maxn = 128 + 10;
char a[maxn];
stack<char>s;
int cnt;
void solve()
{
	int flag = 1;
	cnt = strlen(a) - 1;
	if (cnt != 0)
	{
		s.push(a[0]);
		for (int i = 1; i < cnt; i++)
		if (a[i] == ')'&&!s.empty())
		{
			char ch = s.top(); s.pop();
			if (ch != '('){ flag = 0; break; }
		}
		else if (a[i] == ']'&&!s.empty())
		{
			char ch = s.top(); s.pop();
			if (ch != '['){ flag = 0; break; }
		}
		else if (a[i] == '(' || a[i] == '[')s.push(a[i]);
		else { flag = 0; break; }
	}
	if (!s.empty())flag = 0;
	if (flag)cout << "Yes\n";
	else cout << "No\n";
	while (!s.empty())s.pop();
}
int main()
{
	int t;
	cin >> t;
	getchar();
	while (t--)
	{
		memset(a, 0, sizeof(a));
		cnt = 0;
		fgets(a, maxn, stdin);
		solve();
	}
	return 0;
}