I. A Stack or A Queue?
来源:互联网 发布:发卡平台源码2016免费 编辑:程序博客网 时间:2024/06/05 17:56
I. A Stack or A Queue?
Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one.
Here comes the problem: given the order of some integers (it is assumed that the stack and queue are both for integers) going into the structure and coming out of it, please guess what kind of data structure it could be - stack or queue?
Notice that here we assume that none of the integers are popped out before all the integers are pushed into the structure.
Input
There are multiple test cases. The first line of input contains an integer T (T <= 100), indicating the number of test cases. Then T test cases follow.
Each test case contains 3 lines: The first line of each test case contains only one integer N indicating the number of integers (1 <= N <= 100). The second line of each test case contains N integers separated by a space, which are given in the order of going into the structure (that is, the first one is the earliest going in). The third line of each test case also contains N integers separated by a space, whick are given in the order of coming out of the structure (the first one is the earliest coming out).
Output
For each test case, output your guess in a single line. If the structure can only be a stack, output "stack"; or if the structure can only be a queue, output "queue"; otherwise if the structure can be either a stack or a queue, output "both", or else otherwise output "neither".
Sample Input
431 2 33 2 131 2 31 2 331 2 11 2 131 2 32 3 1
Sample Output
stackqueuebothneither#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
using namespace std;
int main()
{
//std::ios::sync_with_stdio(false);
int t;
while (cin>>t)
{
while (t--)
{
int n;
cin >> n;
int a1[1000], a2[1000];
for (int i = 0; i < n; i++)
cin >> a1[i];
for (int i = 0; i < n; i++)
cin >> a2[i];
int flag1 = 0, flag2 = 0;
int n1 = n;
for (int i = 0; i < n; i++)
{
if (a1[i] != a2[--n1])
{
flag1 = 1;
break;
}
}
for (int i = 0; i < n; i++)
{
if (a1[i] != a2[i])
{
flag2 = 1;
break;
}
}
if (flag1 == 0 && flag2 == 0) puts("both");
else if (flag1 == 0 && flag2 ==1) puts("stack");
else if (flag1 ==1 && flag2 == 0) puts("queue");
else if(flag1==1&&flag2==1) puts("neither");
}
}
return 0;
}
- I. A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue
- zoj 3210 A Stack or A Queue?
- A Stack or A Queue?(zoj 3210)
- ZOJ 3210 A Stack or A Queue?
- D - A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- zoj3210 A Stack or A Queue?
- POJ3210 a stack or a queue
- ZOJ 3210 A Stack or A Queue?
- ZOJ#3210:A Stack or A Queue?
- MyBatis--查询缓存--内置二级缓存配置
- MFC Windows程序设计--视图扩展
- 二分图染色问题
- V4L2框架分析
- Linux环境下段错误的产生原因及调试方法小结
- I. A Stack or A Queue?
- CPP复习笔记 4
- Linux下安装NFS
- Easy 5 Valid Parentheses(20)
- 谈谈我对Builder建造者模式的想法
- 常见面试之机器学习算法思想简单梳理
- SDNU 1490.Problem_H Miller_Rabin算法判断素数
- 易忘点汇总
- Oracle6