括号配对问题描述输入输出样例输入样例输出解析代码实现运行结果参考链接

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

No
No
Yes

#include<iostream>
#include<stack>
#include<string>
using namespace std;
int main(){

    int n;
    cin>>n;
    while(n--){
        stack<char> s;
        string ch;
        cin>>ch;
        for(int i=0;i<ch.length();i++){
            if(s.empty()){//如果栈为空继续进栈

                s.push(ch[i]);
            }else{
                if(ch[i]=='('||ch[i]=='[') s.push(ch[i]);
                else{
                    if(ch[i]==')'){
                        if(s.top()=='(')s.pop();
                        else s.push(ch[i]);
                    }
                    if(ch[i]==']'){
                        if(s.top()=='[')s.pop();
                        else s.push(ch[i]);
                    }
                }
            }
        }
        if(s.empty()){
            cout<<"Yes"<<endl;
        }else{
            cout<<"No"<<endl;
        }
    }
}