A Stack or A Queue?
来源:互联网 发布:http post json 编辑:程序博客网 时间:2024/06/05 04:19
Description
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 integerN indicating the number of integers (1 <=N <= 100). The second line of each test case containsN 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 containsN 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<stdio.h>int z[107],y[107];int main(){ int m; while(scanf("%d",&m)!=EOF) { while(m--) { int n; scanf("%d",&n); for(int a=0; a<n; a++) scanf("%d",&z[a]); for(int b=0; b<n; b++) scanf("%d",&y[b]); int count1=0,count2=0; for(int c=0; c<n; c++) { if(z[c]==y[n-1-c])count1++; if(z[c]==y[c])count2++; } if(count1==(n)&&count2==(n))printf("both\n"); else if(count1==(n)&&count2!=(n))printf("stack\n"); else if(count1!=(n)&&count2==(n))printf("queue\n"); else if(count1!=(n)&&count2!=(n))printf("neither\n"); } }}
- 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 ?
- Android图像处理之熔铸特效
- The input character is not valid in MATLAB statements or expressions.
- ant不是内部命令也不是外部命令问题的解决方法
- [转载]int,int32_t,int64_t
- IE插件在注册表中的相关位置
- A Stack or A Queue?
- Git详解之一 Git起步
- POJ-1155--TELE--树形DP
- Schema(模式)
- 可评审代码之道
- SSC 内存管理
- 温习HttpClient使用范例
- 成绩评估
- 计算机视觉领域的一些牛人博客,超有实力的研究机构等的网站链接