zoukankan      html  css  js  c++  java
  • zoj 3210 A Stack or A Queue? (数据结构水题)

    版权声明:本文为博主原创文章。未经博主同意不得转载。 https://blog.csdn.net/u014253173/article/details/26284647
    
    A Stack or A Queue?

    Time Limit: 1 Second      Memory Limit: 32768 KB

    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


    水题一道~,主要是考察栈和队列的基本原理,先入先出的是队列,后入先出的是栈~,

    主要是对输入和输出进行推断即可了,是否能与他们吻合。

    以下是ac的代码:

    #include <iostream>
    #include <cstdio>
    using namespace std;
    const int maxn=120;
    int a[maxn];
    int main()
    {
       int t,n,x;
       scanf("%d",&t);
       while(t--)
       {
           bool isqueue=true; //推断是栈还是队列
           bool isstack=true;
           scanf("%d",&n);
           for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
           for(int i=0;i<n;i++)
           {
            scanf("%d",&x);
            if(x!=a[i])
                isqueue=false;
            if(x!=a[n-i-1])
                isstack=false;
           }
           if(isstack&&isqueue)
              printf("both
    ");
           else if(isqueue)
            printf("queue
    ");
           else if(isstack)
            printf("stack
    ");
           else
            printf("neither
    ");
       }
        return 0;
    }
    

查看全文
  • 相关阅读:
    焦虑:都说程序员是青春饭,那么程序员老了何去何从呢?
    数据库查询语句优化,mysql优化,join语句优化附带YYC松鼠短视频系统详细demo效果
    IT行业:为什么大部分人都不认可php语言呢?
    拇指赚点赞无加密源码发布分享仅供学习
    区块鼠区块养殖系统源码无加密源码发布分享仅供学习
    3月1日晚突遭大量攻击,网站/APP突然遭遇黑客攻击时该如何应对?
    ThinkPHP内核全行业小程序运营管理系统源码免费分享下载
    2020年不管打工还是创业,居然还有人相信读书无用论?
    在IT界,应聘企业去上班如果老板一点不懂技术那绝对是作茧自缚
    看了这篇文章你还不懂傅里叶变换,那我就真没办法呢!
  • 原文地址:https://www.cnblogs.com/ldxsuanfa/p/10895837.html
  • Copyright © 2011-2022 走看看