AizuOJ 1173 The Balance of the World (栈)

最新推荐文章于 2021-10-19 19:09:42 发布

高自期许

最新推荐文章于 2021-10-19 19:09:42 发布

阅读量253

点赞数

分类专栏：模拟文章标签：栈

本文链接：https://blog.csdn.net/weixin_44014982/article/details/102295406

版权

模拟专栏收录该内容

32 篇文章 1 订阅

订阅专栏

The Balance of the World
Time Limit : 8 sec, Memory Limit : 131072 KB
English / Japanese
The Balance of the World
The world should be finely balanced. Positive vs. negative, light vs. shadow, and left vs. right brackets. Your mission is to write a program that judges whether a string is balanced with respect to brackets so that we can observe the balance of the world.

A string that will be given to the program may have two kinds of brackets, round (“( )”) and square (“[ ]”). A string is balanced if and only if the following conditions hold.

For every left round bracket (“(”), there is a corresponding right round bracket (“)”) in the following part of the string.
For every left square bracket (“[”), there is a corresponding right square bracket (“]”) in the following part of the string.
For every right bracket, there is a left bracket corresponding to it.
Correspondences of brackets have to be one to one, that is, a single bracket never corresponds to two or more brackets.
For every pair of corresponding left and right brackets, the substring between them is balanced.
Input
The input consists of one or more lines, each of which being a dataset. A dataset is a string that consists of English alphabets, space characters, and two kinds of brackets, round (“( )”) and square (“[ ]”), terminated by a period. You can assume that every line has 100 characters or less. The line formed by a single period indicates the end of the input, which is not a dataset.

Output
For each dataset, output “yes” if the string is balanced, or “no” otherwise, in a line. There may not be any extra characters in the output.

Sample Input
So when I die (the [first] I will see in (heaven) is a score list).
[ first in ] ( first out ).
Half Moon tonight (At least it is better than no Moon at all].
A rope may form )( a trail in a maze.
Help( I[m being held prisoner in a fortune cookie factory)].
([ (([( [ ] ) ( ) (( ))] )) ]).
.
.
Output for the Sample Input
yes
yes
no
no
no
yes
yes

题目链接：http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1173
题意：括号匹配
solution：

#include <bits/stdc++.h>
using namespace std;

int main()
{
	string s;
	while (true){
		getline(cin, s);
		if (s == ".")return 0;
		bool flag = true;
		stack<char> sta;
		for (int i = 0; flag && i < s.length(); ++i){
			if (s[i] == '(' || s[i] == '['){
				sta.push(s[i]);
			}
			else if (s[i] == ')'){
				if (sta.empty() || sta.top() != '(')flag = false;
				else sta.pop();
			}
			else if (s[i] == ']'){
				if (sta.empty() || sta.top() != '[')flag = false;
				else sta.pop();
			}
		}
		if (!sta.empty())flag = false;
		if (flag)cout << "yes" << endl;
		else cout << "no" << endl;
	}
}