杭电1022题
2012-04-19 22:59
330 查看
栈的运用题目,注意最后要清空栈,否则会WA
代码:
代码:
#include<iostream> #include<vector> #include<string> #include<stack> using namespace std; int main(){ int n,i,j; char in[100],out[100]; stack<char> s; vector<string> steps; while(cin>>n>>in>>out){ i=j=0; while(i<n){ s.push(in[i++]); steps.push_back("in"); while(!s.empty()){ if(s.top()==out[j]&&j<=n){ s.pop(); steps.push_back("out"); j++; } else break; } } if(s.empty()){ cout<<"Yes."<<endl; for(i=0;i<steps.size();i++) cout<<steps[i]<<endl; cout<<"FINISH"<<endl; } else cout<<"No."<<endl<<"FINISH"<<endl; steps.clear(); for(i=s.size();i>0;i--) s.pop(); } return 0; }
相关文章推荐
- Java 杭电ACM Train Problem I 1022
- 杭电ACM OJ 1022 Train Problem I 回溯法求出栈遍历序列 很强大
- 杭电1022 Train Problem I(栈)
- 杭电1022 Train Problem I
- 杭电ACM 1022 Train Problem I
- 杭电1022-Train Problem I
- Train Problem I(杭电1022)(栈的应用)
- 杭电 队列 1022
- 杭电1022 train problem
- 杭电1022 Train Problem I
- 杭电acm 1022题
- 杭电1022(栈的入门)(二)
- 杭电1022 train problom
- 【杭电-oj】-1022-Train Problem I (栈,好)
- 【ACM】杭电1022:Train Problem I
- 杭电 1022火车进站
- 【ACM】杭电1022:Train Problem I
- 杭电1022(栈的运用) 之 Train Problem I
- 杭电1022——Train Problem I(栈的应用)
- 【杭电】[1022]Train Problem I