[HBU-实验]2-8 符号配对 (20 分)（未完成）

基本思路：
判断能否配对，利用堆栈（符号配对状态）
用一个map来记录应有配对，遇到右侧符号时看map里是否符合

还差最后一个点……不知道是什么边边角角的测试，回头再搞搞吧

#include<bits/stdc++.h>
using namespace std;
int main()
{stack<string> mark;vector<string> sentence;string s;string ch;int num=0;map<string,string> sign;sign["/*"]="*/";sign["("] = ")";sign["{"] = "}";sign["["] = "]";getline(cin,s);while(s!="."){sentence.push_back(s);getline(cin,s);}for(auto it=sentence.begin();it!=sentence.end();it++){string col=*it;for(int i=0;i<col.length();i++){int f2=0;string c;switch (col[i]){case '(':case '[':case '{':c=col[i];mark.push(string(c));break;case '/':if(col[i+1]=='*'){c="/*";mark.push("/*");i++;}break;case ')':case ']':case '}':f2=1;c=col[i];if(mark.empty()){cout << "NO"<<endl;cout << "?-" << c;return 0;}ch =mark.top();mark.pop();break;case '*':if(col[i+1]=='/'){c="*/";if(mark.empty()){cout << "NO"<<endl;cout << "?-" << c;return 0;}ch=mark.top();mark.pop();i++;break;}}if(f2==1&&sign[ch]!=c){cout << "NO" << endl;if(mark.empty())      cout << "?-" << c;else      cout << ch << "-?";return 0;}}}if(!mark.empty()){string c = mark.top();cout << "NO"<<endl;cout << c << "-?";}else{cout << "YES";}
}