A - The Balance of the World

Day2—A

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

题意：输入字符串，判断字符串内括号是否配对即不能出现[),)(,][,(]等情况

思路：用栈模拟，左括号入栈，右括号出栈，判断是否是配对，最后判断栈是否为空

代码如下：

#include<iostream>
#include<algorithm>
#include<map>
#include<cstring>
#include<vector>
#include<stack>
#include<deque>
#include<cstdio>
#include<stdio.h>
using namespace std;


int main()
{
    std::ios::sync_with_stdio(false);
    stack<char>s;
    char a[105],x;
    while(1)
    {
        while(!s.empty())
        s.pop();
        fgets(a,105,stdin);
        if(strcmp(a,".\n")==0)
        break;
        bool flag=true;
        int n=strlen(a);
        for(int i=0;i<n;i++)
        {
            if(a[i]=='('||a[i]=='[')
               s.push(a[i]);
            else if(a[i]==')'||a[i]==']')
            {
                if(s.empty())
                {
                    flag=false;
                    break;
                }
                x=s.top();
                s.pop();
                if(x=='('&&a[i]==']'||x=='['&&a[i]==')')
                {
                    flag=false;
                    break;
                }
            }
        }
        if(flag==true&&s.empty())
        cout<<"yes"<<endl;
        else
        cout<<"no"<<endl;
    }
}