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 OUTSample Output
1 2 2 1 1 2 None 2 3
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
int main()
{
int t;
cin>>t;
getchar();
while(t--)
{
int n;
scanf("%d ",&n);
string s1,s2;
cin >> s1;
if(s1=="FIFO")
{
queue<int>qu;
while(n--)
{
cin>>s2;
if(s2=="IN")
{
int num;
cin>>num;
qu.push(num);
}
else
{
if(qu.empty())
{
cout<<"None"<<endl;
}
else
{
cout<<qu.front()<<endl;
qu.pop();
}
}
}
}
if(s1=="FILO")
{
stack<int>st;
while(n--)
{
cin>>s2;
if(s2=="IN")
{
int num;
cin>>num;
st.push(num);
}
else
{
if(st.empty())
{
cout<<"None"<<endl;
}
else
{
cout<<st.top()<<endl;
st.pop();
}
}
}
}
}
return 0;
}
C语言编程练习41:ACboy needs your help again!
原文:https://www.cnblogs.com/FantasticDoubleFish/p/14345266.html