解题思路:使用STL模板类stack处理元素入栈出栈
注意事项:
参考代码:
#include<iostream> #include<string> #include<stack> #include<list> using namespace std; int main() { int n, i, j; string o1, o2; while (cin >> n >> o1 >> o2) { stack<char> s; list<string> l; i = j = 0; while (i < n) { s.push(o1[i++]); l.push_back("in"); while (j < n) { if (s.empty() || s.top() != o2[j]) break; s.pop(); l.push_back("out"); j++; } } if (s.empty()) { cout << "Yes.\n"; for (auto it = l.begin(); it != l.end(); ++it) cout << *it << '\n'; } else cout << "No.\n"; cout << "FINISH\n"; } return 0; }
0.0分
0 人评分