ACboy needs your help again!(stack和queue)

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zhangxiaoduoduo/article/details/79963381


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!
InputThe 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.OutputFor 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
4
4 FIFO
IN 1
IN 2
OUT
OUT
4 FILO
IN 1
IN 2
OUT
OUT
5 FIFO
IN 1
IN 2
OUT
OUT
OUT
5 FILO
IN 1
IN 2
OUT
IN 3
OUT
Sample Output
1
2
2
1
1
2
None
2
3

题意:FIFO:先进先出  FILO:先进后出

思路:先进先出是队列,先进后出是栈

AC代码:


#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;

int main()
{
    int T,n,m;
    char c[5],op[5];
    cin>>T;
    while(T--){
        stack<int> s;
        queue<int> q;
        cin>>n>>c;
        if(c[2]=='L'){
            for(int i=1;i<=n;++i){
                cin>>op; 
                if(op[0]=='I'){cin>>m;s.push(m);} 
                else if(op[0]=='O'&&!s.empty()){
                        cout<<s.top()<<endl;
                        s.pop();
                }
                else cout<<"None"<<endl;
            }
        }
        if(c[2]=='F'){
            for(int i=1;i<=n;++i){
                cin>>op;
                if(op[0]=='I'){cin>>m;q.push(m);}
                else if(op[0]=='O'&&!q.empty()){
                        cout<<q.front()<<endl;
                        q.pop();
                    }
                else cout<<"None"<<endl;
            }
        }
    }
    return 0;
}

阅读更多
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页