hdu 1702 栈和队列
来源:互联网 发布:网络棋牌游戏代理 编辑:程序博客网 时间:2024/06/07 06:45
ACboy needs your help again!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2799 Accepted Submission(s): 1462
Problem Description
ACboy was kidnapped!!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!
Input
The input contains multiple test cases.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
Output
For each command "OUT", you should output a integer depend on the word is "FIFO" or "FILO", or a word "None" if you don't have any integer.
Sample Input
44 FIFOIN 1IN 2OUTOUT4 FILOIN 1IN 2OUTOUT5 FIFOIN 1IN 2OUTOUTOUT5 FILOIN 1IN 2OUTIN 3OUT
Sample Output
122112None23
都是基本操作
考察了栈和队列的联系与区别。栈是先进后出,而队列是先进先出。队列可以想象成在超市排队买东西,先排队的人先买到东西。栈就想象成桶堆积物品。STL队列 STL栈
注意:
compare()函数以多种方式比较本字符串和str,返回:
返回值情况
小于零 this < str
零 this == str
大于零 this > str
代码如下:
#include <iostream>#include <string>#include <stack>#include <queue>using namespace std;void queueExe(int n){ int x; string s; queue<int> q; while(n--) { cin>>s; if(s.compare("IN")==0)//if s=='IN' { cin>>x; q.push(x); } else if(s.compare("OUT")==0) { if(q.empty()) { cout<<"None"<<endl; } else { cout<<q.front()<<endl;//front 队头 q.pop(); } } }}void stackExe(int n){ int x; string s; stack<int> q; while(n--) { cin>>s; if(s.compare("IN")==0) { cin>>x; q.push(x); } else if(s.compare("OUT")==0) { if(q.empty()) { cout<<"None"<<endl; } else { cout<<q.top()<<endl; q.pop(); } } }}int main(){ int T,N; string strtype; string cmd; while(cin>>T) { while(T--) { cin>>N>>strtype; if(strtype.compare("FIFO")==0) queueExe(N); else if(strtype.compare("FILO")==0) stackExe(N); else cout<<"error"<<endl; } } return 0;}
0 0
- hdu 1702 栈和队列
- HDU 1702简单的栈和队列
- hdu 1702 栈和队列的简单应用
- HDU 1702----ACboy needs your help again!(栈和队列)
- hdu 1702 整理下水题 栈和队列
- HDU 1702 (栈和队列的模拟)
- HDU-1702 ACboy needs your help again! 栈和队列
- hdu 4041 Eliminate Witches! 栈和队列
- 栈和队列--队列
- 【栈和队列】队列
- hdu 2717 bfs和队列。。
- hdu-1022 栈、队列
- HDU 1702 ACboy needs your help again! 栈和队列的使用
- hdu 1702 ACboy needs your help again!(模拟栈和队列)
- hdu杭电1702 ACboy needs your help again!【栈和队列】
- hdu-1702 ACboy needs your help again!(栈和队列的结合)
- HDU 1702 ACboy needs your help again!(栈和队列)
- hdu杭电1702 ACboy needs your help again!【栈和队列】
- USB Camera在android车机上应用前景及初试小结
- 3835. 计算三角形的周长
- 文件系统制作过程中遇到的问题
- bash脚本使用相对目录的问题dirname
- linux下的C语言开发(开篇)
- hdu 1702 栈和队列
- 最大似然估计、MAP及贝叶斯估计
- 数据结构之顺序表
- Ubuntu下MPI并行环境配置
- 编译QtE-4.5.3出现的问题
- Permutations II 排列II
- java 动态代理 黑马程序员学习笔记(8)
- 解读《TCP/IP详解》(卷1):02章:链路层
- tslib移植中环境变量编辑