UVA 括号匹配

Parentheses Balance

You are given a string consisting of parentheses () and []. A string of this type is said to be correct:

(a)

if it is the empty string

(b)

if A and B are correct, AB is correct,

(c)

if A is correct,  (A ) and  [A ] is correct.

Write a program that takes a sequence of strings of this type and check their correctness. Your program can assume that the maximum string length is 128.

Input 

The file contains a positive integer  n  and a sequence of  n  strings of parentheses  ()  and  [] , one string a line.

Output 

A sequence of  Yes  or  No  on the output file.

Sample Input 

3
([])
(([()])))
([()[]()])()

Sample Output 

Yes
No
Yes

 

#include <iostream>
#include <fstream>
#include <string.h>
#include <stdlib.h>
#include <stack>
using namespace std;
bool ok(char *p){
    stack<char>sta;
    while(*p){
        if(*p=='('){sta.push(*p);}
        else if(*p=='[')sta.push(*p);
        else if(*p==')')
        {
            if(sta.empty())return false;
            if(sta.top()=='(')sta.pop();
            else{return false;}
        }
        else if(*p==']')
        {
            if(sta.empty())return false;
            if(sta.top()=='[')sta.pop();
            else{return false;}
        }
        p++;
    }
    if(!sta.empty())return false;
    return true;
}
int main()
{
    //ifstream fin("ha.txt");
    int t;
    char line[130];
    cin>>t;
    cin.get();
    while(t--)
    {

        cin.getline(line,130);
        if(ok(line))cout<<"Yes"<<endl;
        else{cout<<"No"<<endl;}
    }
}

Parentheses Balance

You are given a string consisting of parentheses () and []. A string of this type is said to be correct:

(a)

if it is the empty string

(b)

if A and B are correct, AB is correct,

(c)

if A is correct,  (A ) and  [A ] is correct.

Write a program that takes a sequence of strings of this type and check their correctness. Your program can assume that the maximum string length is 128.

Input 

The file contains a positive integer  n  and a sequence of  n  strings of parentheses  ()  and  [] , one string a line.

Output 

A sequence of  Yes  or  No  on the output file.

Sample Input 

3
([])
(([()])))
([()[]()])()

Sample Output 

Yes
No
Yes