Problem I: STL——括号匹配

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 2512  Solved: 1464
[Submit][Status][WebBoard]

Description

Input

Output

Sample Input

Sample Output

HINT

Append Code

根据提示，本题可以用常量容器stack实现，再辅助利用string中的成员函数即可，题目较为简单。代码如下：

#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
using namespace std;
int main()
{string st;while(cin>>st){stack<string> s;for(int i = 0; i < st.size(); i++){if(s.empty())s.push(st);else{if(st[i] == '(')s.push(st);elses.pop();}}if(s.empty())cout<<"YES"<<endl;elsecout<<"NO"<<endl;while(!s.empty())s.pop();}return 0;
}