UVA - 11995 - I Can Guess the Data Structure!（栈、队列、优先队列）

最新推荐文章于 2020-03-10 14:48:00 发布

Violet-Guo

最新推荐文章于 2020-03-10 14:48:00 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏：栈 && 队数据结构文章标签： uva 栈队列优先队列

本文链接：https://blog.youkuaiyun.com/violet_echo_0908/article/details/47398107

该博客介绍了一个UVA的编程题目，要求根据一系列操作判断数据结构是栈、队列、优先队列还是其他。输入包含若干测试用例，每个用例包含不同类型的操作，包括插入元素和返回元素。输出应为判断结果：栈、队列、优先队列或不可能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

UVA 11995.I Can Guess the Data Structure!

Description

There is a bag-like data structure, supporting two operations:

operation	meaning
1 x	Throw an element x into the bag.
2	Take out an element from the bag.

Given a sequence of operations with return values, you’re going to guess the data structure. It is a stack (Last-In, First-Out), a queue (First-In, First-Out), a priority-queue (Always take out larger elements first) or something else that you can hardly imagine!