A Stack or A Queue?
来源:互联网 发布:计算概率的软件 编辑:程序博客网 时间:2024/05/21 17:38
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
4
3
1 2 3
3 2 1
3
1 2 3
1 2 3
3
1 2 1
1 2 1
3
1 2 3
2 3 1
Sample Output
stack
queue
both
neither
这道题很水,但是我写的代码更水。唉勉强着看吧。
#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>using namespace std;int main(){ int T; scanf("%d",&T); while(T--) { int k=0; int flag=0; int gold=0; scanf("%d",&k); int a[k]; int b[k]; for(int i=0;i<k;i++){ scanf("%d",&a[i]); } for(int j=0;j<k;j++){ scanf("%d",&b[j]); } for(int m=0;m<k;m++){ if(a[m]==b[k-m-1]){ flag++; } } for(int n=0;n<k;n++){ if(a[n]==b[n]){ gold++; } } if(flag==k&&gold==k){ printf("both\n"); } else if(flag==k&&gold!=k){ printf("stack\n"); } else if(flag!=k&&gold==k){ printf("queue\n"); }else{ printf("neither\n"); } } return 0;}
- 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?
- ZOJ 3210 A Stack or A Queue ?
- 机器人程序设计——之如何正确入门ROS | 硬创公开课(附视频/PPT) 文章摘要
- easyui datagrid 批量编辑和提交 并改变修改过单元格的颜色
- C语言(Head First C)-2_2:存储器和指针
- 深入理解Java集合框架系列-第三章 使用集合排序
- 文章标题
- A Stack or A Queue?
- 关于后处理的节点篇
- Linux线程同步机制三--读写锁rwlock
- 堆与堆排序
- poj2010(优先队列)
- iOS 应用的生命周期
- C++代码规范
- 欧几里德, 与 扩展欧几里德
- 常用函数